Effective computation of immersion obstructions for unions of graph classes (Q395009): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q2904552
aliases / en / 0aliases / en / 0
 
Effective Computation of Immersion Obstructions for Unions of Graph Classes
description / endescription / en
 
scientific article; zbMATH DE number 6065667
Property / title
 
Effective Computation of Immersion Obstructions for Unions of Graph Classes (English)
Property / title: Effective Computation of Immersion Obstructions for Unions of Graph Classes (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1357.05130 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-31155-0_15 / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithm Theory – SWAT 2012 / rank
 
Normal rank
Property / publication date
 
14 August 2012
Timestamp+2012-08-14T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 14 August 2012 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6065667 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2791393500 / rank
 
Normal rank

Revision as of 12:09, 29 April 2024

scientific article; zbMATH DE number 6065667
  • Effective Computation of Immersion Obstructions for Unions of Graph Classes
Language Label Description Also known as
English
Effective computation of immersion obstructions for unions of graph classes
scientific article; zbMATH DE number 6065667
  • Effective Computation of Immersion Obstructions for Unions of Graph Classes

Statements

Effective computation of immersion obstructions for unions of graph classes (English)
0 references
Effective Computation of Immersion Obstructions for Unions of Graph Classes (English)
0 references
0 references
0 references
28 January 2014
0 references
14 August 2012
0 references
immersions
0 references
obstructions
0 references
unique linkage theorem
0 references
tree-width
0 references

Identifiers

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