Pathwidth

Results: 53



#Item
1Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth David Coudert, Dorian Mazauric, Nicolas Nisse To cite this version:

Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth David Coudert, Dorian Mazauric, Nicolas Nisse To cite this version:

Add to Reading List

Source URL: hal.inria.fr

- Date: 2016-12-19 17:36:36
    2On Self Duality of Pathwidth in Polyhedral Graph Embeddings Fedor V. Fomin1 and Dimitrios M. Thilikos2 1 DEPARTMENT OF INFORMATICS

    On Self Duality of Pathwidth in Polyhedral Graph Embeddings Fedor V. Fomin1 and Dimitrios M. Thilikos2 1 DEPARTMENT OF INFORMATICS

    Add to Reading List

    Source URL: users.uoa.gr

    - Date: 2014-06-11 17:30:33
      3Characterizing 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
      4New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ Archontia C. Giannopoulou and George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK archont

      New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ Archontia C. Giannopoulou and George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK archont

      Add to Reading List

      Source URL: community.dur.ac.uk

      Language: English - Date: 2015-03-12 21:45:21
      5Finding 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
      6On 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
      7User Guide for Wimmut Client (Version 0.1) User Guide for Wimmut Client Introduction Quick Start Simple Use Cases

      User Guide for Wimmut Client (Version 0.1) User Guide for Wimmut Client Introduction Quick Start Simple Use Cases

      Add to Reading List

      Source URL: dms.sztaki.hu

      Language: English - Date: 2011-12-01 11:20:48
      8Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,? , Pim van ’t Hof1,? , Marcin Kami´ nski2,?? , and Dani¨el Paulusma3,? ? ? 1

      Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,? , Pim van ’t Hof1,? , Marcin Kami´ nski2,?? , and Dani¨el Paulusma3,? ? ? 1

      Add to Reading List

      Source URL: rutcor.rutgers.edu

      Language: English - Date: 2014-07-12 10:24:09
      9Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and its Applications Otfried Schwarzkopf y

      Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and its Applications Otfried Schwarzkopf y

      Add to Reading List

      Source URL: www.math.tau.ac.il

      Language: English - Date: 2012-06-29 10:28:55
      10An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy∗ George B. Mertzios† Abstract Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree o

      An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy∗ George B. Mertzios† Abstract Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree o

      Add to Reading List

      Source URL: community.dur.ac.uk

      Language: English - Date: 2012-12-29 10:50:56