On short cycles through prescribed vertices of a graph.
Frank GöringJochen HarantErhard HexelZsolt TuzaPublished in: Discret. Math. (2004)
Keyphrases
- weighted graph
- labeled graphs
- undirected graph
- random graphs
- edge weights
- hamiltonian cycle
- adjacency matrix
- minimum weight
- average degree
- bipartite graph
- planar graphs
- random walk
- directed edges
- vertex set
- graph theoretic
- graph partitioning
- graph structure
- graph based algorithm
- maximum cardinality
- maximum matching
- attributed graphs
- graph theory
- graph model
- strongly connected
- graph representation
- stable set
- structured data
- dependency graph
- maximal cliques
- directed acyclic graph
- directed graph
- connected components
- shortest path
- graph clustering
- connected graphs
- search algorithm
- homology generators