Partitioning vertices of 1-tough graphs into paths.
Cristina BazganAmel Harkat-BenhamdineHao LiMariusz WozniakPublished in: Theor. Comput. Sci. (2001)
Keyphrases
- vertex set
- weighted graph
- graph partitioning
- labeled graphs
- attributed graphs
- undirected graph
- adjacency matrix
- shortest path
- random graphs
- spectral graph
- hamiltonian cycle
- partitioning algorithm
- edge weights
- connected graphs
- connected subgraphs
- maximum cardinality
- average degree
- graph theory
- graph matching
- graph clustering
- planar graphs
- maximal cliques
- graph databases
- graph mining
- directed graph
- graph theoretic
- graph representation
- directed edges
- series parallel
- data sets
- path length
- small world
- normalized cut
- graph model