Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs.
Naonori KakimuraKen-ichi KawarabayashiYusuke KobayashiPublished in: SIAM J. Discret. Math. (2017)
Keyphrases
- connected graphs
- edge disjoint
- spanning tree
- undirected graph
- weighted graph
- edge weights
- total length
- data structure
- subgraph isomorphism
- edge detector
- connected subgraphs
- closed form
- vertex set
- labeled graphs
- edge information
- edge detection
- minimum cost
- fixed number
- subgraph mining
- graph mining
- partial differential equations
- shortest path
- query graph
- markov random field