Blossom algorithm

Results: 4



#Item
1PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic

PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic

Add to Reading List

Source URL: www.cs.mun.ca

Language: English - Date: 2015-03-23 10:06:06
2Anarchy, Stability, and Utopia: Creating Better Matchings Elliot Anshelevich Sanmay Das Yonatan Naamad

Anarchy, Stability, and Utopia: Creating Better Matchings Elliot Anshelevich Sanmay Das Yonatan Naamad

Add to Reading List

Source URL: www.cs.rpi.edu

Language: English - Date: 2011-07-18 11:44:44
3b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1

b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2014-02-09 09:55:11
4

PDF Document

Add to Reading List

Source URL: gauss.cs.ucsb.edu

Language: English - Date: 2015-02-21 18:14:23