Almost eulerian compatible spanning circuits in edge-colored graphs.
Zhiwei GuoHajo BroersmaBinlong LiShenggui ZhangPublished in: Discret. Math. (2021)
Keyphrases
- weighted graph
- undirected graph
- minimum spanning trees
- graph theoretic
- graph theory
- vertex set
- edge information
- edge weights
- edge detection
- random graphs
- high speed
- adjacency graph
- graph mining
- level set method
- graph partitioning
- subgraph isomorphism
- graph construction
- circuit design
- spanning tree
- graph clustering
- graph representation
- social networks
- bipartite graph
- directed graph
- low cost
- pairwise
- image segmentation