On packing 3-vertex paths in a graph.
Atsushi KanekoAlexander K. KelmansTsuyoshi NishimuraPublished in: J. Graph Theory (2001)
Keyphrases
- directed graph
- undirected graph
- labeled graphs
- minimum weight
- edge weights
- vertex set
- hamiltonian cycle
- shortest path
- bipartite graph
- graph theory
- graph structure
- graph model
- disjoint paths
- weighted graph
- average degree
- random walk
- graph representation
- graph theoretic
- path length
- structured data
- spanning tree
- graph matching
- connected components
- attributed graphs
- maximum cardinality
- graph structures
- graph search
- website
- strongly connected
- graph partitioning
- betweenness centrality
- traveling salesman problem
- connected subgraphs
- neural network