A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4281625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination problems for permutation and other graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of the generalized clique-transversal problem on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K_ i\)-covers. I: Complexity and polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generalized clique covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximumk-colorings andk-coverings of transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for finding a maximum weight 2-independent set on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the feedback vertex set problem in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized vertex covering in interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \(k\)-covering of weighted transitive graphs with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(96)00193-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011576340 / rank
 
Normal rank

Latest revision as of 10:28, 30 July 2024

scientific article
Language Label Description Also known as
English
A linear-time algorithm for the weighted feedback vertex problem on interval graphs
scientific article

    Statements

    A linear-time algorithm for the weighted feedback vertex problem on interval graphs (English)
    0 references
    0 references
    0 references
    26 May 2016
    0 references
    \(C_{3, 1}\) problem
    0 references
    2-colorable subgraph problem
    0 references
    2-independent set problem
    0 references
    interval graphs
    0 references

    Identifiers