O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs.">O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"An O(nlogn) Algorithm for Finding Minimal Path Cover in ..."

Y. Daniel Liang, Glenn K. Manacher (1993)

> Home

Details and statistics

DOI: 10.1145/170791.170879

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/acm/LiangM93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acm/LiangM93
Y. Daniel Liang, Glenn K. Manacher:
An O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs. ACM Conference on Computer Science 1993: 390-397

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.