<--- Back to Details
First PageDocument Content
Graph theory / NP-complete problems / Longest path problem / Interval graph / Hamiltonian path / Independent set / Chordal graph / Indifference graph / Path / Permutation graph / Pathwidth / Graph coloring
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

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

Download Document from Source Website

File Size: 197,68 KB

Share Document on Facebook

Similar Documents

Network Analysis and Modeling, CSCI 5352 LectureProf. Aaron Clauset

Network Analysis and Modeling, CSCI 5352 LectureProf. Aaron Clauset

DocID: 1r8wD - View Document

Permutation groups and the graph isomorphism problem Sumanta Ghosh and Piyush P Kurur Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India

Permutation groups and the graph isomorphism problem Sumanta Ghosh and Piyush P Kurur Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India

DocID: 1r7bO - View Document

Spectral Graph Theory and its Applications  out: September 9, 2004 Problem Set 1 Lecturer: Daniel A. Spielman

Spectral Graph Theory and its Applications out: September 9, 2004 Problem Set 1 Lecturer: Daniel A. Spielman

DocID: 1q0te - View Document

The Longest Path Problem is Polynomial on Interval Graphs Kyriaki Ioannidou1? , George B. Mertzios2?? , and Stavros D. Nikolopoulos1? 1  2

The Longest Path Problem is Polynomial on Interval Graphs Kyriaki Ioannidou1? , George B. Mertzios2?? , and Stavros D. Nikolopoulos1? 1 2

DocID: 1pX1E - View Document

SIAM J. COMPUT. Vol. 40, No. 5, pp. 1234–1257 c 2011 Society for Industrial and Applied Mathematics 

SIAM J. COMPUT. Vol. 40, No. 5, pp. 1234–1257 c 2011 Society for Industrial and Applied Mathematics 

DocID: 1pRpG - View Document