Chordal problem - PDFSEARCH.IO - Document Search Engine

Chordal problem
Results: 25

#	Item
1	Discrete Applied Mathematics–399 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2014-01-31 12:40:59 Graph theory NP-complete problems Circular-arc graph Hamiltonian path Intersection graph Graph Path Interval graph Chordal graph Indifference graph Longest path problem Split graph
2	The Longest Path Problem is Polynomial on Interval Graphs Kyriaki Ioannidou1? , George B. Mertzios2?? , and Stavros D. Nikolopoulos1? 1 2 Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2009-06-12 14:16:54 Graph theory NP-complete problems Longest path problem Interval graph Hamiltonian path Independent set Chordal graph Indifference graph Path Permutation graph Pathwidth Graph coloring
3	SIAM J. DISCRETE MATH. Vol. 26, No. 3, pp. 940–963 c 2012 Society for Industrial and Applied Mathematics Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2012-10-09 12:22:03 NP-complete problems Search algorithms Permutation graph Chordal graph Graph Permutation Longest path problem Hamiltonian path Comparability graph Depth-first search Interval graph Skew-symmetric graph
4	Algorithmica:320–341 DOIs00453The Longest Path Problem has a Polynomial Solution on Interval Graphs Kyriaki Ioannidou · George B. Mertzios · Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2011-12-14 14:10:08 NP-complete problems Interval graph Strongly chordal graph Hamiltonian path Longest path problem Chordal graph Indifference graph Permutation graph Path Pathwidth Graph minor
5	New results for the 2-interval pattern problem Guillaume Blin1 , Guillaume Fertin1 , and Stéphane Vialette2 1 LINA, FRE CNRS 2729 Université de Nantes, 2 rue de la Houssinière Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:28:57 NP-complete problems Trapezoid graph Interval graph Independent set Clique Matching Intersection graph Comparability graph Chordal graph Trivially perfect graph Interval scheduling
6	0 AHLIN and REITER PROBLEM DEPARTMENT ASHLEY AHLIN Add to Reading List Source URL: www.pme-math.org Language: English - Date: 2013-10-17 15:53:04 Graph coloring Chordal graph
7	Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs of Bounded Clique Number∗† Konrad Dabrowski1 , Vadim Lozin1‡, Haiko M¨ uller2 , and Dieter Rautenbach3 1 Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2012-04-30 01:44:46 NP-complete problems Chordal graph Bipartite graph Clique problem Interval graph Claw-free graph Clique Graph minor Perfect graph Split graph Independent set Graph
8	An Optimal Probabilistic Graphical Model for Point Set Matching Tib´erio S. Caetano1,2 , Terry Caelli1 , and Dante A. C. Barone2 1 2 Add to Reading List Source URL: www.tiberiocaetano.com Language: English - Date: 2008-05-10 06:35:04 Clique Chordal graph Line graph Matching Markov random field Graphical model Graph coloring Clique problem Graph theory Graph operations Tree decomposition
9	Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth Add to Reading List Source URL: jair.org Language: English - Date: 2012-03-19 16:09:33 Tree decomposition Interval graph Floyd–Warshall algorithm Neighbourhood Clique Split graph Shortest path problem Path decomposition Degeneracy Graph theory Graph operations Chordal graph