Detecting Feedback Vertex Sets of Size K in O*(2.7k) Time

doi 10.1137/1.9781611975994.58
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Feedback Vertex Sets in Tournaments

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

2-Approximating Feedback Vertex Set in Tournaments

2020English

Detecting Fraud in Financial Data Sets

Journal of Business & Economics Research (JBER)
2010English

A Cubic Kernel for Feedback Vertex Set

English

Chromatic Number in Time O(2.4023^n) Using Maximal Independent Sets

BRICS Report Series
2002English

Maximal K-Independent Sets in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

A K-Median Algorithm With Running Time Independent of Data Size

Machine Learning
Artificial IntelligenceSoftware
2004English

Finding a Latent K–simplex in O* (K · Nnz(data)) Time via Subset Smoothing

2020English

Forbidden K‐Sets in the Plane

SIAM Journal on Discrete Mathematics
Mathematics
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy