An Optimal Algorithm for the ::::k::::-Fixed-Endpoint Path Cover on Proper Interval Graphs

George B. Mertzios, Walter Unger. An Optimal Algorithm for the ::::k::::-Fixed-Endpoint Path Cover on Proper Interval Graphs. Mathematics in Computer Science, 3(1):85-96, 2010. [doi]

@article{MertziosU10a,
  title = {An Optimal Algorithm for the ::::k::::-Fixed-Endpoint Path Cover on Proper Interval Graphs},
  author = {George B. Mertzios and Walter Unger},
  year = {2010},
  url = {http://springerlink.metapress.com/content/9532luk5214urn05/},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/MertziosU10a},
  cites = {0},
  citedby = {0},
  journal = {Mathematics in Computer Science},
  volume = {3},
  number = {1},
  pages = {85-96},
}