Ear decomposition

Results: 86



#Item
1Characterizing 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

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2012-05-06 07:54:01
2Unique 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

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-06-20 11:55:09
3Query 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,

Add to Reading List

Source URL: www.dr-dau.net

Language: English - Date: 2007-08-09 21:04:38
4This 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

Add to Reading List

Source URL: www2.ece.ohio-state.edu

Language: English - Date: 2016-03-04 15:36:09
5Aachen Department of Computer Science Technical Report Better termination proving through cooperation

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

Add to Reading List

Source URL: sunsite.informatik.rwth-aachen.de

Language: English - Date: 2013-04-14 08:37:31
6Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains Isabelle Stanton∗ Ali Pinar† UC Berkeley Sandia National Laboratories‡

Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains Isabelle Stanton∗ Ali Pinar† UC Berkeley Sandia National Laboratories‡

Add to Reading List

Source URL: www.sandia.gov

Language: English - Date: 2011-01-04 15:53:31
7Efficient Comparison of Massive Graphs Through The Use Of ‘Graph Fingerprints’ Stephen Bonner John Brennan

Efficient Comparison of Massive Graphs Through The Use Of ‘Graph Fingerprints’ Stephen Bonner John Brennan

Add to Reading List

Source URL: www.mlgworkshop.org

Language: English - Date: 2016-08-14 01:22:56
8Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France

Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 05:27:10
9Spectral Graph Theory and Applications Time and Location: Wednesday 2:00PM – 4:00PM, Room 024, MPI building, Campus E1. 4 Lecturers: Dr. Thomas Sauerwald and Dr. He Sun Credits: 5 ECTS points Course Description: Over t

Spectral Graph Theory and Applications Time and Location: Wednesday 2:00PM – 4:00PM, Room 024, MPI building, Campus E1. 4 Lecturers: Dr. Thomas Sauerwald and Dr. He Sun Credits: 5 ECTS points Course Description: Over t

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2011-10-17 05:01:37
10On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´

On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2009-04-29 03:46:21