On alpha-redundant vertices in P5-free graphs.
Andreas BrandstädtHoàng-Oanh LeVan Bang LePublished in: Inf. Process. Lett. (2002)
Keyphrases
- weighted graph
- labeled graphs
- random graphs
- undirected graph
- attributed graphs
- hamiltonian cycle
- adjacency matrix
- maximal cliques
- maximum cardinality
- bipartite graph
- graph theory
- connected subgraphs
- graph structure
- graph matching
- query graph
- directed graph
- planar graphs
- average degree
- graph representation
- minimum weight
- directed edges
- neural network
- edge weights
- graph databases
- graph mining
- directed acyclic graph
- highly redundant
- shortest path
- knn
- real time