Universal graphs with a forbidden near-path or 2-bouquet.
Gregory L. CherlinLasse TallgrenPublished in: J. Graph Theory (2007)
Keyphrases
- graph mining
- structured objects
- graph matching
- real time
- shortest path
- graph theory
- endpoints
- graph model
- graph databases
- data sets
- series parallel
- graph clustering
- graph partitioning
- spanning tree
- directed graph
- query processing
- minimum cost
- undirected graph
- weighted graph
- graph theoretic
- optimal path
- small world
- random graphs
- strongly connected
- search algorithm
- sequence prediction
- graph isomorphism