On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques.
Ioan TomescuPublished in: COCOON (2002)
Keyphrases
- maximum number
- graph structure
- directed graph
- weighted graph
- undirected graph
- edge weights
- minimum weight
- vertex set
- labeled graphs
- maximal cliques
- graph representation
- maximum clique
- attributed graphs
- average degree
- hamiltonian cycle
- random walk
- graph structures
- bipartite graph
- connected components
- graph theoretic
- maximum cardinality
- graph construction
- spanning tree
- directed acyclic graph
- graph matching
- structured data
- dependency graph
- strongly connected
- graph theory
- branch and bound algorithm
- rough sets
- neural network