Graphs with no induced five-vertex path or antipath.
Maria ChudnovskyLouis EsperetLaetitia LemoinePeter MaceliFrédéric MaffrayIrena PenevPublished in: CoRR (2014)
Keyphrases
- undirected graph
- edge weights
- directed graph
- attributed graphs
- labeled graphs
- shortest path
- maximum cardinality
- strongly connected
- hamiltonian cycle
- minimum cost
- betweenness centrality
- graph matching
- endpoints
- graph theoretic
- connected subgraphs
- weighted graph
- graph theory
- bipartite graph
- finding the shortest path
- graph structure
- dynamic graph
- data sets
- minimum weight
- random graphs
- graph clustering
- graph data
- graph mining