Counting the Number of Vertex Covers With Minimum / Maximum Weight in a Weighted Interval Graph

2013 
This study provides O(n) algorithms to count the number of minimum/maximum weighted vertex covers in a weighted interval graph.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []