Geometric graphs with no self-intersecting path of length three.
János PachRom PinchasiGábor TardosGéza TóthPublished in: Eur. J. Comb. (2004)
Keyphrases
- graph theoretical
- path length
- graph theory
- shortest path
- graph matching
- directed graph
- geometric information
- minimum length
- strongly connected
- small world
- random graphs
- graph databases
- graph representation
- graph theoretic
- series parallel
- reeb graph
- data sets
- graph model
- graph mining
- geometric structure
- bipartite graph
- np hard
- multiscale