A New Graph Model and Algorithms for Consistent Superstring Problems

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences - United Kingdom
doi 10.1098/rsta.2013.0134
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Royal Society

Related search

Algorithms for Weighted Graph Problems on the Modified Cellular Graph Automaton

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1989English

Efficient Parallel Algorithms for a Class of Graph Theoretic Problems

SIAM Journal on Computing
MathematicsComputer Science
1984English

New Approximation Algorithms for Graph Coloring

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1994English

Faster Scaling Algorithms for General Graph Matching Problems

1989English

A New Combinatorial Approach for Sparse Graph Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(Network Design, Control and Optimization)

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
2004English

Approximation Algorithms for the Shortest Superstring Problem.

English

Graph-Theoretic Problems and Their New Applications

Mathematics
Mathematics
2020English

Factor-Graph Algorithms for Equalization

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy