Login / Signup
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths.
Rémy Belmonte
Petr A. Golovach
Pinar Heggernes
Pim van 't Hof
Marcin Kaminski
Daniël Paulusma
Published in:
ISAAC (2011)
Keyphrases
</>
disjoint paths
undirected graph
directed graph
approximation algorithms
spanning tree
strongly connected
complex networks
connected components
graph structure
random graphs
minimum cost
directed acyclic graph
graph structures
graph databases
data mining
computational complexity
clustering algorithm