Edge contraction

Results: 34



#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
2On 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
3VERTEX PERFECT GRAPHS  By Riley Littlefield  A SENIOR RESEARCH PAPER PRESENTED TO THE DEPARTMENT OF

VERTEX PERFECT GRAPHS By Riley Littlefield A SENIOR RESEARCH PAPER PRESENTED TO THE DEPARTMENT OF

Add to Reading List

Source URL: www2.stetson.edu

Language: English - Date: 2015-04-24 19:11:58
4Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma

Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2011-07-20 16:48:47
5Increasing the Minimum Degree of a Graph by Contractions? Petr A. Golovach1 , Marcin Kami´ nski2 , Dani¨el Paulusma1 , and Dimitrios M. Thilikos3 1

Increasing the Minimum Degree of a Graph by Contractions? Petr A. Golovach1 , Marcin Kami´ nski2 , Dani¨el Paulusma1 , and Dimitrios M. Thilikos3 1

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2011-07-20 16:50:25
6Spectral Graph Theory  Lecture 9 Tutte’s Theorem Daniel A. Spielman

Spectral Graph Theory Lecture 9 Tutte’s Theorem Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2015-09-30 14:01:49
7Parameterized Complexity Dichotomy for Steiner Multicut∗ Karl Bringmann† Danny Hermelin‡  Matthias Mnich§

Parameterized Complexity Dichotomy for Steiner Multicut∗ Karl Bringmann† Danny Hermelin‡ Matthias Mnich§

Add to Reading List

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

Language: English - Date: 2016-01-03 06:47:29
8Lift Contractions Petr Golovach1 Marcin Kami´ nski2 Dani¨el Paulusma1 Dimitrios Thilikos3

Lift Contractions Petr Golovach1 Marcin Kami´ nski2 Dani¨el Paulusma1 Dimitrios Thilikos3

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2011-09-12 05:30:07
9Towards Fast, Believable Real-time Rendering of Burning Objects in Video Games Dhanyu Amarasinghe and Ian Parberry Technical Report LARCLaboratory for Recreational Computing Department of Computer Science & Engi

Towards Fast, Believable Real-time Rendering of Burning Objects in Video Games Dhanyu Amarasinghe and Ian Parberry Technical Report LARCLaboratory for Recreational Computing Department of Computer Science & Engi

Add to Reading List

Source URL: larc.unt.edu

Language: English - Date: 2011-05-12 17:46:43
10Formal Verification of Coalescing Graph-Coloring Register Allocation Sandrine Blazy1 , Benoˆıt Robillard2 , and Andrew W. Appel3 1  IRISA - Universit´e Rennes 1

Formal Verification of Coalescing Graph-Coloring Register Allocation Sandrine Blazy1 , Benoˆıt Robillard2 , and Andrew W. Appel3 1 IRISA - Universit´e Rennes 1

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 2010-01-12 16:36:12