Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q128744089, #quickstatements; #temporary_batch_1723663638014 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128744089 / rank | |||
Normal rank | |||
Latest revision as of 22: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
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
