Efficient algorithms for planar embedding of graphs with constraints in placing specified vertices on face boundaries.

Published in: ISCAS (5) (2002)

Keyphrases

planar graphs
random graphs
weighted graph
graph embedding
labeled graphs
graph matching
undirected graph
maximal cliques
hamiltonian cycle
face images
vector space
average degree
graph theory
directed edges
attributed graphs
subgraph isomorphism
object boundaries
multi view