Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph.
Alexander GrigorievBert MarchalNatalya UsotskayaPublished in: SOFSEM (2010)
Keyphrases
- data structure
- graph data
- graph theory
- graph properties
- computational complexity
- optimization problems
- graph mining
- learning algorithm
- maximum clique
- partitioning algorithm
- graph structures
- edge information
- weighted graph
- directed graph
- connected components
- edge detection
- edge weights
- constant factor
- maximum flow
- random walk
- strongly connected
- data mining
- connected subgraphs