A branching greedoid for multiply-rooted graphs and digraphs.
Lauren EatonSteven J. TedfordPublished in: Discret. Math. (2010)
Keyphrases
- directed graph
- undirected graph
- graph matching
- graph theory
- graph mining
- branch and bound
- graph partitioning
- graph databases
- graph model
- weighted graph
- graph theoretic
- graph representation
- equivalence classes
- graph clustering
- structured objects
- database
- graph properties
- floating point
- search tree
- random walk
- pairwise
- data structure
- information systems
- data sets