Minimum Leaf Out-Branching Problems (Q3511432)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Minimum Leaf Out-Branching Problems	scientific article

Statements

scholarly article

0 references

Minimum Leaf Out-Branching Problems (English)

0 references

0 references

0 references

0 references

Algorithmic Aspects in Information and Management

0 references

publication date

10 July 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-68880-8_23

0 references

Parameterized Algorithms for Directed Maximum Leaf Problems

0 references

Better Algorithms and Bounds for Directed Maximum Leaf Problems

0 references

Spanning Directed Trees with Many Leaves

0 references

Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)

0 references

The minimum spanning strong subdigraph problem is fixed parameter tractable

0 references

Refined memorization for vertex cover

0 references

0 references

Parametrized complexity theory.

0 references

The linear arrangement problem parameterized above guaranteed value

0 references

Fixed-Parameter Complexity of Minimum Profile Problems

0 references

0 references

An algorithm for enumerating all spanning trees of a directed graph

0 references

Sur les arborescences dans un graphe oriente

0 references

Parameterizing above Guaranteed Values: MaxSat and MaxCut

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-68880-8_23

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3511432

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