Data structures for incremental interval coloring

DOI10.1007/978-3-030-26176-4_40MaRDI QIDQ2300068zbMATH OpenOpenAlexFDO

Authors J. Girish Raguvir, Manas Jyoti Kashyop, N. S. Narayanaswamy

Publication date 24 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-26176-4_40

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Dynamic data structures for interval coloring
• scientific article; zbMATH DE number 6850309
• Dynamic graph coloring
• Dynamic graph coloring
• scientific article; zbMATH DE number 17824

Cited in

(2)

• Dynamic data structures for interval coloring
• Dynamic algorithms for monotonic interval scheduling problem

This page was built for publication: Data structures for incremental interval coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300068)