On decomposition of r-partite graphs into edge-disjoint hamilton circuits.
Renu C. LaskarBruce AuerbachPublished in: Discret. Math. (1976)
Keyphrases
- edge disjoint
- spanning tree
- graph structure
- structural learning
- minimum cost
- total length
- logic synthesis
- high speed
- weighted graph
- undirected graph
- graph theoretic
- decomposition method
- graph mining
- graph structures
- multiresolution
- decomposition algorithm
- decomposition methods
- graph partitioning
- asynchronous circuits
- digital circuits
- np complete
- low cost
- probabilistic model