Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs.
Tamás KirályLap Chi LauPublished in: J. Comb. Theory, Ser. B (2008)
Keyphrases
- exact solution
- min max
- graph theory
- multiobjective optimization
- max min
- max cut
- minimum spanning tree
- adjacency matrix
- graph theoretic
- graph representation
- graph matching
- graph databases
- graph mining
- bipartite graph
- directed graph
- data sets
- subgraph isomorphism
- hypergraph model
- steiner tree
- graph clustering
- graph partitioning
- social network analysis
- bayesian networks
- social networks