LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs

Published 2013 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
Authors
Keywords
-
Journal
SIAM JOURNAL ON COMPUTING
Volume 42, Issue 3, Pages 792-807
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Online
2013-05-03
DOI
10.1137/11083856x

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.