A polynomial solution to the -fixed-endpoint path cover problem on proper interval graphs (original) (raw)
Related papers
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs
Algorithmica, 2009
The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph
Computing Research Repository - CORR, 2008
A polynomial solution to the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll">mml:mik-fixed-endpoint path cover problem on proper interval graphs
Theoretical Computer Science, 2010
A linear-time algorithm for thek-fixed-endpoint path cover problem on cographs
Networks, 2007
Uniquely Restricted Matchings in Interval Graphs
SIAM Journal on Discrete Mathematics, 2018
End vertices in interval graphs
Discrete Applied Mathematics, 1988
The Longest Path Problem has a Polynomial Solution on Interval Graphs
Algorithmica, 2010
Multi-dimensional Interval Routing Schemes
Springer eBooks, 1995
Covering and coloring problems for relatives of intervals
Discrete Mathematics, 1985
The Steiner cycle and path cover problem on interval graphs
2021
Minimum proper interval graphs
Discrete Mathematics, 1995
1999
Interval scheduling maximizing minimum coverage
Discrete Applied Mathematics, 2017
Interval bigraphs and circular arc graphs
Journal of Graph Theory, 2004
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
SIAM Journal on Computing, 1996
All Graphs with at most 8 nodes are 2-interval-PCGs
arXiv (Cornell University), 2022
The Longest Path Problem Is Polynomial on Cocomparability Graphs
Algorithmica, 2011
The harmonious coloring problem is NP-complete for interval and permutation graphs
Discrete Applied Mathematics, 2007
A Simple Cubic Algorithm for Computing Minimum Height Elimination Trees for Interval Graphs
1996
Assistance and Interdiction Problems on Interval Graphs
2021
On Some Classes of Problems on Graphs
International Conference on Information and Communication Technologies in Education, Research, and Industrial Applications, 2019
Generalized Bounded Tree Cover of a Graph
Journal of Graph Algorithms and Applications
A sufficient condition for the unpaired k-disjoint path coverability of interval graphs
The Journal of Supercomputing
General-demand disjoint path covers in a graph with faulty elements
International Journal of Computer Mathematics, 2012
Canonical Data Structure for Interval Probe Graphs
Lecture Notes in Computer Science, 2004
Applied Mathematics Letters, 2011
Deferred-query: An efficient approach for some problems on interval graphs
Networks, 1999
The Balanced Connected Subgraph Problem
Algorithms and Discrete Applied Mathematics, 2019
An Incremental Approach to the Set Covering Problem
Characterization of interval graphs that are unpaired 2-disjoint path coverable
Theoretical Computer Science, 2020
On a class of covering problems with variable capacities in wireless networks
Resource Constrained Shortest Paths
Lecture Notes in Computer Science, 2000
Bounding and computing obstacle numbers of graphs
arXiv (Cornell University), 2022
Some computational aspects of solvable regular covers of graphs
Journal of Symbolic Computation, 2015
Balanced Connected Subgraph Problem in Geometric Intersection Graphs
Combinatorial Optimization and Applications, 2019