Exact algorithms for intervalizing colored graphs

Authors:
Hans L. Bodlaender;Johan M. M. van Rooij
Affiliations:
Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands;Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands
Venue:
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Year:
2011

Citing 12
Cited 0

Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

Journal of Algorithms
Triangulating Vertex-Colored Graphs

SIAM Journal on Discrete Mathematics
Regular Article: On the Complexity of DNA Physical Mapping

Advances in Applied Mathematics
Graph sandwich problems

Journal of Algorithms
Efficient and constructive algorithms for the pathwidth and treewidth of graphs

Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
On intervalizing k-colored graphs for DNA physical mapping

Discrete Applied Mathematics - Special volume on computational molecular biology
Intervalizing k-Colored Graphs

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
DNA Physical Mapping: Three Ways Difficult

ESA '93 Proceedings of the First Annual European Symposium on Algorithms
On exact algorithms for treewidth

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Minimal interval completions

ESA'05 Proceedings of the 13th annual European conference on Algorithms
The Bidimensionality Theory and Its Algorithmic Applications 1

The Computer Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the INTERVALIZING COLOURED GRAPHS problem, one must decide for a given graph G = (V,E) with a proper vertex coloring of G whether G is the subgraph of a properly colored interval graph. For the case that the number of colors k is fixed, we give an exact algorithm that uses O*(2n/log1-ε(n)) time for all ε 0. We also give an O*(2n) algorithm for the case that the number of colors k is not fixed.