Determining the minimum rank of matroids whose basis graph is common.
Masahiro HachimoriHiroshi KurataTadashi SakumaPublished in: Electron. Notes Discret. Math. (2008)
Keyphrases
- independent set
- spanning tree
- random walk
- directed graph
- graph theory
- edge disjoint
- structured data
- graph structure
- graph model
- lower bound
- connected dominating set
- minimum cut
- constant factor
- similarity scores
- graphical representation
- graph representation
- directed acyclic graph
- bayesian networks
- undirected graph
- minimum cost
- graph data
- random graphs
- graph construction
- adjacency matrix
- weighted graph
- dependency graph
- maximum weight
- bipartite graph
- connected components
- np hard