The role of planarity in connectivity problems parameterized by treewidth (Q2514121): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
aliases / en / 0aliases / en / 0
 
The Role of Planarity in Connectivity Problems Parameterized by Treewidth
description / endescription / en
scientific article
scientific article; zbMATH DE number 6482347
Property / title
 
The Role of Planarity in Connectivity Problems Parameterized by Treewidth (English)
Property / title: The Role of Planarity in Connectivity Problems Parameterized by Treewidth (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1457.68131 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-13524-3_6 / rank
 
Normal rank
Property / published in
 
Property / published in: Parameterized and Exact Computation / rank
 
Normal rank
Property / publication date
 
15 September 2015
Timestamp+2015-09-15T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 15 September 2015 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6482347 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2183582012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2569915728 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1312.2889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Fast Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Catalan structures and dynamic programming in \(H\)-minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the decomposability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming for H-minor-free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming for graphs on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank

Latest revision as of 15:23, 9 July 2024

scientific article; zbMATH DE number 6482347
  • The Role of Planarity in Connectivity Problems Parameterized by Treewidth
Language Label Description Also known as
English
The role of planarity in connectivity problems parameterized by treewidth
scientific article; zbMATH DE number 6482347
  • The Role of Planarity in Connectivity Problems Parameterized by Treewidth

Statements

The role of planarity in connectivity problems parameterized by treewidth (English)
0 references
The Role of Planarity in Connectivity Problems Parameterized by Treewidth (English)
0 references
0 references
0 references
0 references
0 references
30 January 2015
0 references
15 September 2015
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
parameterized complexity
0 references
treewidth
0 references
connectivity problems
0 references
single-exponential algorithms
0 references
planar graphs
0 references
dynamic programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references