Spotting Trees with Few Leaves (Q3448789)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Spotting Trees with Few Leaves	scientific article

Statements

scholarly article

0 references

Spotting Trees with Few Leaves (English)

0 references

Andreas Björklund

0 references

0 references

Łukasz Kowalik

0 references

0 references

Automata, Languages, and Programming

0 references

publication date

27 October 2015

0 references

full work available at URL

https://arxiv.org/abs/1501.00563

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Determinant Sums for Undirected Hamiltonicity

0 references

The Travelling Salesman Problem in Bounded Degree Graphs

0 references

Narrow sieves for parameterized paths and packings

0 references

Spotting Trees with Few Leaves

0 references

Probably optimal graph motifs

0 references

Fast Witness Extraction Using a Decision Oracle

0 references

Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms

0 references

Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem

0 references

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

0 references

A probabilistic remark on algebraic program testing

0 references

The Traveling Salesman Problem for Cubic Graphs

0 references

Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms

0 references

Representative Sets of Product Families

0 references

Approximation Algorithms and Semidefinite Programming

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

A note on the complexity of minimum dominating set

0 references

On the Number of Hamilton Cycles in Bounded Degree Graphs

0 references

The Operator $\Psi$ for the Chromatic Number of a Graph

0 references

An Improved Exact Algorithm for Cubic Graph TSP

0 references

Faster Algebraic Algorithms for Path and Packing Problems

0 references

A 2k-vertex Kernel for Maximum Internal Spanning Tree

0 references

Three short proofs in graph theory

0 references

0 references

Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems

0 references

Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems

0 references

0 references

Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}

0 references

Exact Computation of Maximum Induced Forest

0 references

Fast Probabilistic Algorithms for Verification of Polynomial Identities

0 references

Representative Families: A Unified Tradeoff-Based Approach

0 references

Finding paths of length \(k\) in \(O^{*}(2^k)\) time

0 references

Algorithms for k-Internal Out-Branching

0 references

Mixing Color Coding-Related Techniques

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-47672-7_20

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3448789

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