The crossing numbers of Cartesian products of paths with 5-vertex graphs.
Marián KlescPublished in: Discret. Math. (2001)
Keyphrases
- undirected graph
- directed graph
- labeled graphs
- attributed graphs
- graph matching
- hamiltonian cycle
- shortest path
- connected subgraphs
- edge weights
- maximum cardinality
- vertex set
- average degree
- pattern recognition
- graph theoretic
- graph mining
- graph structure
- graph theory
- complex structures
- biological networks
- graph databases
- path finding
- product recommendation
- series parallel
- approximation algorithms
- betweenness centrality
- complex networks