Publication:4427867
From MaRDI portal
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
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
68W20: Randomized algorithms
Related Items
On Counting Parameterized Matching and Packing, Unnamed Item, Unnamed Item, Unnamed Item, Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle, On the parameterized complexity of approximate counting, Approximate Counting of k-Paths: Deterministic and in Polynomial Space, Parameterized Counting and Cayley Graph Expanders, Vertex cover problem parameterized above and below tight bounds, The complexity of counting homomorphisms seen from the other side, Compactors for parameterized counting problems, The challenges of unbounded treewidth in parameterised subgraph counting problems, The parameterized complexity of probability amplification, On counting 3-D matchings of size \(k\), Randomised enumeration of small witnesses using a decision oracle, Computing the number of induced copies of a fixed graph in a bounded degree graph, Parameterized random complexity, Finding and counting vertex-colored subtrees, The parameterised complexity of counting connected subgraphs and graph motifs, A fixed-parameter perspective on \#BIS, The parameterized complexity of maximality and minimality problems, Parameterized counting matching and packing: a family of hard problems that admit FPTRAS, Some Hard Families of Parameterized Counting Problems, Parameterized Derandomization, Balanced Hashing, Color Coding and Approximate Counting
