On cycles through prescribed vertices in weakly separable graphs.
Alexander K. KelmansM. V. LomonosovPublished in: Discret. Math. (1983)
Keyphrases
- weighted graph
- labeled graphs
- random graphs
- undirected graph
- attributed graphs
- graph matching
- adjacency matrix
- planar graphs
- average degree
- connected subgraphs
- maximal cliques
- edge weights
- vertex set
- query graph
- directed edges
- hamiltonian cycle
- maximum cardinality
- subgraph isomorphism
- directed graph
- connected graphs
- pairwise
- graph clustering
- graph data
- graph theoretic
- graph representation
- spanning tree
- helmholtz principle
- graph databases