Pages that link to "Item:Q1124602"
From MaRDI portal
The following pages link to An on-line graph coloring algorithm with sublinear performance ratio (Q1124602):
Displaying 50 items.
- On the complexity of injective colorings and its generalizations (Q387816) (← links)
- On the online track assignment problem (Q423916) (← links)
- Online coloring of bipartite graphs with and without advice (Q486981) (← links)
- An on-line competitive algorithm for coloring bipartite graphs without long induced paths (Q524365) (← links)
- On-line secret sharing (Q664393) (← links)
- On the max coloring problem (Q690449) (← links)
- Online chromatic number is PSPACE-complete (Q726097) (← links)
- Online promise problems with online width metrics (Q859981) (← links)
- Online unit clustering: Variations on a theme (Q954982) (← links)
- Online coloring graphs with high girth and high odd girth (Q974990) (← links)
- Online hypergraph coloring (Q975516) (← links)
- Effective on-line coloring of \(P_ 5\)-free graphs (Q1180418) (← links)
- The greedy algorithm is optimal for on-line edge coloring (Q1209350) (← links)
- On-line coloring \(k\)-colorable graphs (Q1264277) (← links)
- Lower bounds for on-line graph coloring (Q1331951) (← links)
- On-line load balancing (Q1331958) (← links)
- Nonclairvoyant scheduling (Q1331961) (← links)
- On-line scheduling of jobs with fixed start and end times (Q1331962) (← links)
- On-line coloring of perfect graphs (Q1375694) (← links)
- On-line 3-chromatic graphs. II: Critical graphs (Q1377872) (← links)
- Adding isolated vertices makes some greedy online algorithms optimal (Q1647831) (← links)
- Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561) (← links)
- Non-clairvoyant scheduling with conflicts for unit-size jobs (Q1721929) (← links)
- On-line vertex-covering (Q1770381) (← links)
- The on-line first-fit algorithm for radio frequency assignment problems. (Q1853136) (← links)
- Online independent sets. (Q1853575) (← links)
- On the on-line chromatic number of the family of on-line 3-chromatic graphs (Q1916112) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- Online presentations of finitely generated structures (Q2205949) (← links)
- Tight bounds for online coloring of basic graph classes (Q2223701) (← links)
- Online coloring a token graph (Q2303438) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- Circumference, chromatic number and online coloring (Q2439828) (← links)
- Trade-offs in dynamic coloring for bipartite and general graphs (Q2696273) (← links)
- Lower Bounds for On-line Graph Colorings (Q2942655) (← links)
- An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs (Q2942656) (← links)
- Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints (Q2971144) (← links)
- Online Graph Coloring Against a Randomized Adversary (Q3177338) (← links)
- On-line maximum-order induced hereditary subgraph problems (Q4670672) (← links)
- A structure of punctual dimension two (Q5111521) (← links)
- Tight Bounds for Online Coloring of Basic Graph Classes (Q5111690) (← links)
- (Q5155667) (← links)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592) (← links)
- On the Max Coloring Problem (Q5443379) (← links)
- On the Online Unit Clustering Problem (Q5443383) (← links)
- Dynamic graph coloring (Q5915986) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5918632) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5970811) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)
- Competitive vertex recoloring. (Online disengagement) (Q6107890) (← links)
