Contracting chordal graphs and bipartite graphs to paths and trees

Authors:
Pinar Heggernes;Pim Van 't Hof;Benjamin Lévêque;Christophe Paul
Affiliations:
-;-;-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 8
Cited 0

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
The maximum k-colorable subgraph problem for chordal graphs

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases

Networks
The computational complexity of graph contractions II: Two tough polynomially solvable cases

Networks
Contractions of planar graphs in polynomial time

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
On graph contractions and induced minors

Discrete Applied Mathematics
Edge contractions in subclasses of chordal graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We study the following two graph modification problems: given a graph G and an integer k, decide whether G can be transformed into a tree or into a path, respectively, using at most k edge contractions. These problems, which we call Tree Contraction and Path Contraction, respectively, are known to be NP-complete in general. We show that on chordal graphs these problems can be solved in O(n+m) and O(nm) time, respectively. As a contrast, both problems remain NP-complete when restricted to bipartite input graphs.