On the facets of the lift-and-project relaxations of graph subdivisions.
Néstor E. AguileraMariana S. EscalantePablo G. FeketePublished in: Electron. Notes Discret. Math. (2011)
Keyphrases
- project management
- case study
- lower bound
- graph representation
- spanning tree
- graph structure
- random walk
- directed graph
- graph theoretic
- graph theory
- connected components
- structured data
- linear programming
- semidefinite
- directed acyclic graph
- graph model
- digital libraries
- stable set
- random graphs
- graph structures
- data sets
- graph mining
- learning community
- bipartite graph
- np hard
- clustering algorithm