A refined analysis of online path coloring in trees
DOI10.1007/978-3-319-51741-4_12zbMATH Open1484.68338OpenAlexW2568831210MaRDI QIDQ2971164FDOQ2971164
Authors: Astha Chauhan, N. S. Narayanaswamy 
Publication date: 4 April 2017
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-51741-4_12
Recommendations
Online algorithms; streaming algorithms (68W27) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Edge and vertex intersection of paths in a tree
- Decomposition by clique separators
- The edge intersection graphs of paths in a tree
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Title not available (Why is that?)
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- A recognition algorithm for the intersection graphs of paths in trees
- Title not available (Why is that?)
- A note on first-fit coloring of interval graphs
- On-line routing in all-optical networks
- Efficient routing in all-optical networks
- Title not available (Why is that?)
- Efficient wavelength routing on directed fiber trees
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: A refined analysis of online path coloring in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971164)
