Algorithms – ESA 2004
From MaRDI portal
Publication:5464602
DOI10.1007/b100428zbMath1111.68589OpenAlexW2483610301MaRDI QIDQ5464602
Publication date: 18 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100428
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (7)
Adjacency queries in dynamic sparse graphs ⋮ Many 3-colorings of triangle-free planar graphs ⋮ Fractional coloring of triangle-free planar graphs ⋮ From the plane to higher surfaces ⋮ Fast 3-coloring triangle-free planar graphs ⋮ Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs ⋮ Improved Dynamic Graph Coloring
This page was built for publication: Algorithms – ESA 2004
