Login / Signup
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs.
Pinar Heggernes
Daniel Meister
Andrzej Proskurowski
Published in:
Theor. Comput. Sci. (2011)
Keyphrases
</>
graph model
bipartite graph
graph matching
spanning tree
weighted graph
undirected graph
graph theoretic
pattern recognition
graph partitioning
graph construction
random walk
human visual system
graph representation
adjacency matrix