<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Spanning tree / Axiom of choice / Tree / Minimum spanning tree / Ear decomposition / Graph connectivity / NP-complete problems / Biconnected component / Vertex cover
Date: 2015-11-19 07:35:47
Graph theory
Mathematics
Spanning tree
Axiom of choice
Tree
Minimum spanning tree
Ear decomposition
Graph connectivity
NP-complete problems
Biconnected component
Vertex cover

Downloadedto. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php SIAM J. COMPUT. Vol. 2, No. 4, DecemberSET MERGING ALGORITHMS*

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Download Document from Source Website

File Size: 1,21 MB

Share Document on Facebook

Similar Documents

Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos

Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos

DocID: 1rq3s - View Document

Unique Sink Orientations of Grids  ? Bernd G¨artner1 , Walter D. Morris, Jr.2 , and Leo R¨ ust3

Unique Sink Orientations of Grids ? Bernd G¨artner1 , Walter D. Morris, Jr.2 , and Leo R¨ ust3

DocID: 1riIF - View Document

Query Graphs with Cuts: Mathematical Foundations Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt,

Query Graphs with Cuts: Mathematical Foundations Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt,

DocID: 1rhkc - View Document

This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOITPAMI, IEEE T

This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOITPAMI, IEEE T

DocID: 1rfgs - View Document

Aachen Department of Computer Science Technical Report Better termination proving through cooperation

Aachen Department of Computer Science Technical Report Better termination proving through cooperation

DocID: 1rezO - View Document