Vertex-primitive digraphs having vertices with almost equal neighbourhoods.
Pablo SpigaGabriel VerretPublished in: Eur. J. Comb. (2017)
Keyphrases
- undirected graph
- directed graph
- minimum weight
- hamiltonian cycle
- attributed graphs
- vertex set
- edge weights
- spanning tree
- approximation algorithms
- directed edges
- directed acyclic graph
- connected components
- complex networks
- random graphs
- maximum cardinality
- bipartite graph
- equivalence classes
- traveling salesman problem
- real time
- labeled graphs
- average degree
- adjacency matrix
- minimum length
- geometric primitives
- markov models
- strongly connected
- greedy heuristic
- graph structure
- high level
- case study
- higher level
- special case
- knowledge base