Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q3188893
aliases / en / 0aliases / en / 0
 
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques
description / endescription / en
 
scientific article; zbMATH DE number 6339257
Property / title
 
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques (English)
Property / title: Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1386.68068 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-08404-6_16 / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithm Theory – SWAT 2014 / rank
 
Normal rank
Property / publication date
 
2 September 2014
Timestamp+2014-09-02T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 2 September 2014 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6339257 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W26903954 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60488399 / rank
 
Normal rank

Revision as of 08:28, 6 May 2024

scientific article; zbMATH DE number 6339257
  • Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques
Language Label Description Also known as
English
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
scientific article; zbMATH DE number 6339257
  • Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques

Statements

Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (English)
0 references
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques (English)
0 references
0 references
0 references
0 references
0 references
23 May 2018
0 references
2 September 2014
0 references
parametrized algorithms
0 references
potential maximal cliques
0 references
treewidth
0 references
vertex cover
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