Amanote Research

Amanote Research

    RegisterSign In

A Faster Parameterized Algorithm for Pseudoforest Deletion

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2017.10.018
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsApplied MathematicsDiscrete Mathematics
Date

February 1, 2018

Authors
Hans L. BodlaenderHirotaka OnoYota Otachi
Publisher

Elsevier BV


Related search

A Parameterized Algorithm for Exploring Concept Lattices

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

A New Parameterized Algorithm for Rapid Peptide Sequencing

PLoS ONE
Multidisciplinary
2014English

Subexponential Parameterized Algorithm for Minimum Fill-In

2012English

IREP++, a Faster Rule Learning Algorithm

2004English

A New Property and a Faster Algorithm for Baseball Elimination

SIAM Journal on Discrete Mathematics
Mathematics
2001English

StyP-Boost: A Bilinear Boosting Algorithm for Learning Style-Parameterized Classifiers

2010English

Integrating the Nqueens Algorithm Into a Parameterized Benchmark Suite

2016English

Dramatic Performance Enhancements for the FASTER Optimization Algorithm

Journal of Computational Chemistry
Computational MathematicsChemistry
2006English

A Truncated Levenberg–Marquardt Algorithm for the Calibration of Highly Parameterized Nonlinear Models

Computers and Geosciences
Information SystemsComputers in Earth Sciences
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy