Experimental Analysis of Treewidth (Q5042459)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7604214

Language	Label	Description	Also known as
English	Experimental Analysis of Treewidth	scientific article; zbMATH DE number 7604214

Statements

scholarly article

0 references

Experimental Analysis of Treewidth (English)

0 references

Treewidth, Kernels, and Algorithms

0 references

publication date

19 October 2022

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-42071-0_15

0 references

Complexity of Finding Embeddings in a <i>k</i>-Tree

0 references

On exact algorithms for treewidth

0 references

Treewidth and Minimum Fill-in: Grouping the Minimal Separators

0 references

Listing all potential maximal cliques of a graph

0 references

0 references

Treewidth computation and extremal combinatorics

0 references

Positive-instance driven dynamic programming for treewidth

0 references

Identifiers

10.1007/978-3-030-42071-0_15

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5042459

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5042459&oldid=37444718"