A note on traversing specified vertices in graphs embedded with large representativity.
Ken-ichi KawarabayashiMichael D. PlummerPublished in: Discret. Math. (2010)
Keyphrases
- weighted graph
- random graphs
- labeled graphs
- undirected graph
- adjacency matrix
- attributed graphs
- hamiltonian cycle
- planar graphs
- average degree
- embedded systems
- connected subgraphs
- graph theoretic
- maximal cliques
- maximum cardinality
- graph theory
- graph matching
- graph structure
- graph representation
- directed edges
- bayesian networks
- series parallel
- graph partitioning
- watermarking algorithm
- digital images
- graph patterns
- real world networks
- graph mining
- bipartite graph