Login / Signup
How is a chordal graph like a supersolvable binary matroid?
Raul Cordovil
David Forge
Sulamita Klein
Published in:
Discret. Math. (2004)
Keyphrases
</>
undirected graph
graph representation
structured data
graph theory
connected components
random walk
graph structure
greedy algorithm
combinatorial optimization
weighted graph
graph model
directed graph
graph matching
bipartite graph
graph construction
graph structures
binary images
graph search