Skip to content
<title>Channels - Online Coloring for Graphs of Large Odd Girth :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Online Coloring for Graphs of Large Odd Girth
Search for more channels:
Similar Items: Online Coloring for Graphs of Large Odd Girth
Channel Options
View Record
Explore related channels
Quick Look
Dynamic Edge Coloring of Forests
Quick Look
Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
Quick Look
Faster Deterministic Streaming Vertex Coloring
Quick Look
Beyond Brooks: $(Δ-1)$-Coloring in Semi-Streaming
Quick Look
EPTAS for Hard Graph Cut Problems for Dense Graphs
Quick Look
Online Monotone Metric Embeddings
Quick Look
Online Orthogonal Vectors Revisited
Quick Look
Online Steiner Forest with Recourse
Quick Look
Succinct Graph Representations and Algorithmic Applications
Quick Look
Online Allocation with Unknown Shared Supply
Quick Look
Streaming Complexity Separations for Dense and Sparse Graphs
Quick Look
Optimal Learning-Augmented Algorithm for Online Bidding
Quick Look
Designing sparse temporal graphs satisfying connectivity requirements
Quick Look
The Pareto Frontier of Randomized Learning-Augmented Online Bidding
Quick Look
Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
Quick Look
A Separator for Minor-Free Graphs Beyond the Flow Barrier
Quick Look
Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
Quick Look
The stochastic block model has the overlap graph property for modularity
Quick Look
Small Independent Sets versus Small Separator in Geometric Intersection Graphs
Quick Look
A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
Quick Look
Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
Quick Look
Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
Quick Look
On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank
Quick Look
Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
Load more items
View Record
Prev
Explore related channels
Next
