A New Polynomial-Time Solvable Graph Class for the Minimum Biclique Edge Cover Problem.
Hideaki OtsukiPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2020)
Keyphrases
- weighted graph
- spanning tree
- graph theoretic
- undirected graph
- random walk
- structured data
- edge information
- connected dominating set
- minimum spanning tree
- minimum cost
- edge disjoint
- tree shaped
- dominating set
- disjoint paths
- equivalence class
- graph mining
- graph theory
- graph matching
- directed graph
- image processing
- feature selection
- graph model
- edge weights
- graph data
- connected components
- constraint satisfaction problems
- edge detection