Fully dynamic algorithms for permutation graph coloring

DOI10.1080/00207167908804550zbMath0865.68091OpenAlexW1998882451MaRDI QIDQ3123352

R. Sarnath, Zoran Ivković, Sivaprakasam Sunder

Publication date: 30 June 1997

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167908804550

zbMATH Keywords

permutation graph coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposing a set of points into chains, with applications to permutation and circle graphs
• An efficient algorithm for maxdominance, with applications
• An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains
• On a graph partition problem with application to VLSI layout
• On computing the length of longest increasing subsequences
• Parallel algorithms for permutation graphs
• Permutation Graphs and Transitive Graphs

This page was built for publication: Fully dynamic algorithms for permutation graph coloring