Sciweavers

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

6

COLOGNETWENTE
2007

favoriteEmaildiscussreport

77views Optimization» more COLOGNETWENTE 2007»

Edge cover by bipartite subgraphs

13 years 6 months ago

Edge cover by bipartite subgraphs

Download www.enseignement.polytechnique.fr

Marie-Christine Plateau, Leo Liberti, Laurent Alfa

Real-time Traffic

COLOGNETWENTE 2007 | Optimization |

claim paper

Related Content

» Covering Graphs with Few Complete Bipartite Subgraphs

» C4saturated bipartite graphs

» On the minimal degree implying equality of the largest trianglefree and bipartite subgraph...

» Long Local Searches for Maximal Bipartite Subgraphs

» Approximately Counting Embeddings into Random Graphs

» Covering minimum spanning trees of random subgraphs

» On planar intersection graphs with forbidden subgraphs

» Testing subgraphs in large graphs

» Vertex and Edge Covers with Clustering Properties Complexity and Algorithms

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	COLOGNETWENTE
Authors	Marie-Christine Plateau, Leo Liberti, Laurent Alfandari

Comments (0)