Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs (Q4377126): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jagm.1997.0894 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2043745737 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:26, 20 March 2024
scientific article; zbMATH DE number 1115552
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs |
scientific article; zbMATH DE number 1115552 |
Statements
Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs (English)
0 references
19 July 1998
0 references
maximum induced subgraph problem
0 references