scientific article; zbMATH DE number 1979521
From MaRDI portal
Publication:4427867
zbMath1019.68135MaRDI QIDQ4427867
Publication date: 14 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2518/25180453.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (27)
Compactors for parameterized counting problems ⋮ Parameterized counting matching and packing: a family of hard problems that admit FPTRAS ⋮ Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle ⋮ Parameterized Derandomization ⋮ The challenges of unbounded treewidth in parameterised subgraph counting problems ⋮ Counting Small Induced Subgraphs with Hereditary Properties ⋮ On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts ⋮ Parameterized Counting and Cayley Graph Expanders ⋮ Parameterized random complexity ⋮ Vertex cover problem parameterized above and below tight bounds ⋮ Unnamed Item ⋮ Finding and counting vertex-colored subtrees ⋮ Randomised enumeration of small witnesses using a decision oracle ⋮ On Counting Parameterized Matching and Packing ⋮ Computing the number of induced copies of a fixed graph in a bounded degree graph ⋮ The parameterized complexity of maximality and minimality problems ⋮ The parameterised complexity of counting connected subgraphs and graph motifs ⋮ The parameterized complexity of probability amplification ⋮ The complexity of counting homomorphisms seen from the other side ⋮ A fixed-parameter perspective on \#BIS ⋮ Unnamed Item ⋮ On the parameterized complexity of approximate counting ⋮ Unnamed Item ⋮ Approximate Counting of k-Paths: Deterministic and in Polynomial Space ⋮ Some Hard Families of Parameterized Counting Problems ⋮ Balanced Hashing, Color Coding and Approximate Counting ⋮ On counting 3-D matchings of size \(k\)
This page was built for publication:
