Exact algorithms for intervalizing coloured graphs
From MaRDI portal
Publication:255264
DOI10.1007/s00224-015-9616-6zbMath1331.05202WikidataQ59480234 ScholiaQ59480234MaRDI QIDQ255264
Hans L. Bodlaender, Johan M. M. van Rooij
Publication date: 9 March 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-015-9616-6
graph algorithms; pathwidth; interval graphs; exact algorithms; intervalizing coloured graphs; subexponential time
68W40: Analysis of algorithms
05C38: Paths and cycles
05C15: Coloring of graphs and hypergraphs
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)