Approximation Algorithms for Finding Maximum Induced Expanders

doi 10.1137/1.9781611974782.75
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Exact Combinatorial Algorithms and Experiments for Finding Maximum K-Plexes

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2011English

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

2011English

2-Approximation Algorithm for Finding a Spanning Tree With Maximum Number of Leaves

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Approximation Algorithms for Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Approximation Algorithms for Geometric Networks

English

Improved Approximation Algorithms for Tree Alignment

Journal of Algorithms
1997English

New Approximation Algorithms for Graph Coloring

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1994English

Exact Exponential-Time Algorithms for Finding Bicliques

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

Approximation Algorithms for Fault Tolerant Facility Allocation

SIAM Journal on Discrete Mathematics
Mathematics
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy