On graphs with no induced five-vertex path or paraglider.
Shenwei HuangT. KarthickPublished in: CoRR (2019)
Keyphrases
- directed graph
- undirected graph
- edge weights
- labeled graphs
- shortest path
- hamiltonian cycle
- attributed graphs
- maximum cardinality
- strongly connected
- vertex set
- connected subgraphs
- spanning tree
- graph matching
- weighted graph
- minimum weight
- average degree
- graph theory
- graph theoretic
- betweenness centrality
- graph structures
- wireless sensor networks
- structured objects
- minimum cost
- graph kernels
- graph partitioning
- endpoints
- data sets
- adjacency matrix
- genetic algorithm
- graph clustering
- minimum spanning tree
- complex structures
- graph databases