Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q128744089, #quickstatements; #temporary_batch_1723663638014
 
(5 intermediate revisions by 4 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6810968
scientific article; zbMATH DE number 7040836
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1407.05225 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/j.dam.2018.11.017 / rank
 
Normal rank
Property / published in
 
Property / published in: Discrete Applied Mathematics / rank
 
Normal rank
Property / publication date
 
22 March 2019
Timestamp+2019-03-22T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 22 March 2019 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C22 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7040836 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2574748442 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2905121141 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1701.04634 / rank
 
Normal rank
Property / zbMATH Keywords
 
subset feedback vertex set
Property / zbMATH Keywords: subset feedback vertex set / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
interval graphs
Property / zbMATH Keywords: interval graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
permutation graphs
Property / zbMATH Keywords: permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes with structured neighborhoods and algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694712 / 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: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex set on graphs of low clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster exact algorithms for some terminal set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generalized clique covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Feedback Vertex Set Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms via Monotone Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating minimal subset feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cuts in node weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset feedback vertex sets in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex set on AT-free 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: Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the weighted feedback vertex problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted domination of cocomparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted vertex multicut on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128744089 / rank
 
Normal rank

Latest revision as of 21:10, 14 August 2024

scientific article; zbMATH DE number 7040836
Language Label Description Also known as
English
Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
scientific article; zbMATH DE number 7040836

    Statements

    Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (English)
    0 references
    0 references
    0 references
    22 November 2017
    0 references
    22 March 2019
    0 references
    subset feedback vertex set
    0 references
    graph algorithms
    0 references
    interval graphs
    0 references
    permutation graphs
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references