Exact Combinatorial Algorithms and Experiments for Finding Maximum K-Plexes

Journal of Combinatorial Optimization - Netherlands
doi 10.1007/s10878-011-9391-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Exact Exponential-Time Algorithms for Finding Bicliques

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2010English

Approximation Algorithms for Finding Maximum Induced Expanders

2017English

Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics

2011English

Algorithms for Finding the Weight-Constrained K Longest Paths in a Tree and the Length-Constrained K Maximum-Sum Segments of a Sequence

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2008English

The Algorithm of Finding of K Maximum Flows

SPIIRAS Proceedings
ControlSystems EngineeringInformation SystemsComputer NetworksApplied MathematicsMathematicsCommunicationsComputer Science ApplicationsComputational TheoryComputational MathematicsArtificial Intelligence
2014English

A Combinatorial Construction of High Order Algorithms for Finding Polynomial Roots of Known Multiplicity

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2010English

Combinatorial Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Uniqueness, Intractability and Exact Algorithms: Reflections on Level-K Phylogenetic Networks

Journal of Bioinformatics and Computational Biology
BiochemistryComputer Science ApplicationsMolecular Biology
2009English

A Theory and Algorithms for Combinatorial Reoptimization

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy