Algorithms for Finding Connected Separators Between Antipodal Points

Topology and its Applications - Netherlands
doi 10.1016/j.topol.2007.08.013
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Optimal Parallel Algorithms for Finding Proximate Points, With Applications

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
1998English

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

Primal–Dual Algorithms for Connected Facility Location Problems

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2004English

Primal-Dual Algorithms for Connected Facility Location Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

A Simple Algorithm for Finding All K-Edge-Connected Components

PLoS ONE
Multidisciplinary
2015English

Approximation Algorithms for Connected Graph Factors of Minimum Weight

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2016English

New Algorithms for Finding Irreducible Polynomials Over Finite Fields

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1990English

Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern RecognitionApplied MathematicsComputer VisionMathematicsComputational TheoryArtificial IntelligenceSoftware
1985English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy