Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

ORL
2010

favoriteEmaildiscussreport

76views more ORL 2010»

Small bipartite subgraph polytopes

13 years 2 months ago

Small bipartite subgraph polytopes

Download www.lancs.ac.uk

We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these descriptions were used to compute the integrality ratio of various relaxations of the max-cut problem, again for up to eight nodes.

Laura Galli, Adam N. Letchford

Real-time Traffic

Bipartite Subgraph Polytope | Complete Linear Description | Conjectured Complete Description | ORL 2010 |

claim paper

Related Content

» Transitive Packing

» Structural Analysis for DifferentialAlgebraic Systems Complexity Formulation and Facets

» Small Worlds Among Interlocking Directors Network Structure and Distance in Bipartite Grap...

» Covering Graphs with Few Complete Bipartite Subgraphs

» Bipartite Ramsey numbers and Zarankiewicz numbers

» Ranking hubs and authorities using matrix functions

» Approximately Counting Embeddings into Random Graphs

» Probabilistic Abstraction for Model Checking An Approach Based on Property Testing

» MultiAspectForensics Pattern Mining on LargeScale Heterogeneous Networks with Tensor Analy...

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	ORL
Authors	Laura Galli, Adam N. Letchford

Comments (0)