A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6585371 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(C_{3, 1}\) problem | |||
Property / zbMATH Keywords: \(C_{3, 1}\) problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
2-colorable subgraph problem | |||
Property / zbMATH Keywords: 2-colorable subgraph problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
2-independent set problem | |||
Property / zbMATH Keywords: 2-independent set problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
interval graphs | |||
Property / zbMATH Keywords: interval graphs / rank | |||
Normal rank |
Revision as of 19:52, 27 June 2023
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
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