Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits.
Shuji KijimaShin-ichi TanigawaPublished in: Discret. Math. (2012)
Keyphrases
- edge disjoint
- spanning tree
- planar graphs
- minimum cost
- total length
- undirected graph
- shape analysis
- high speed
- graph matching
- weighted graph
- point correspondences
- high dimensional
- path length
- topological information
- graph mining
- graph connectivity
- connected components
- graph representation
- optimal path
- sparse representation
- shortest path
- analog vlsi
- logic synthesis
- graph coloring
- circuit design
- directed graph
- shape representation