Randomised enumeration of small witnesses using a decision oracle
type: Item
instance of: scholarly article
title: Randomised enumeration of small witnesses using a decision oracle
zbMATH Open document ID: 1411.68049
author: Kitty Meeks
published in: Algorithmica
publication date: 2019-02-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 7023725
zbMATH Keywords: enumeration algorithms
zbMATH Keywords: parameterized complexity
zbMATH Keywords: randomized algorithms
zbMATH Keywords: approximate enumeration
zbMATH Keywords: color coding
MaRDI profile type: Publication
full work available at URL: s00453-018-0404-y
OpenAlex ID: W2962790604
cites work: Color-coding
cites work: Q4427867
cites work: Narrow sieves for parameterized paths and packings
cites work: Probably optimal graph motifs
cites work: Fast Witness Extraction Using a Decision Oracle
cites work: Engineering Motif Search for Large Graphs
cites work: Parameterized Enumeration for Modification Problems
cites work: Paradigms for Parameterized Enumeration
cites work: Counting Matchings of Size k Is $\sharp$ W[1]-Hard
cites work: Fundamentals of parameterized complexity
cites work: Q4808679
cites work: The Parameterized Complexity of Counting Problems
cites work: Parametrized complexity theory.
cites work: The parameterised complexity of counting connected subgraphs and graph motifs
cites work: Some hard families of parameterized counting problems
cites work: Planar graph coloring is not self-reducible, assuming P\(\neq NP\)
cites work: A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
cites work: The challenges of unbounded treewidth in parameterised subgraph counting problems
cites work: Q4231923
DOI: 10.1007/S00453-018-0404-Y
description: scientific article; zbMATH DE number 7023725