Online Dual Edge Coloring of Paths and Trees
From MaRDI portal
Publication:3453294
Recommendations
- Online edge coloring of paths and trees with a fixed number of colors
- A refined analysis of online path coloring in trees
- Online multi-coloring on the path revisited
- Online edge coloring via tree recurrences and correlation decay
- On-line DP-coloring of graphs
- On-line P-coloring of graphs
- Online coloring of hypergraphs
- On-Line Coloring and Recursive Graph Theory
- On-line coloring \(k\)-colorable graphs
- Online coloring co-interval graphs
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- Approximating maximum edge 2-coloring in simple graphs
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
- Approximating the maximum 3- and 4-edge-colorable subgraph (extended abstract)
- Approximating the maximum 3-edge-colorable subgraph problem
- Comparing first-fit and next-fit for online edge coloring
- Competitive snoopy caching
- On-line edge-coloring with a fixed number of colors
- The greedy algorithm is optimal for on-line edge coloring
- The relative worst order ratio for online algorithms
- The relative worst-order ratio applied to paging
Cited in
(5)
This page was built for publication: Online Dual Edge Coloring of Paths and Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453294)