Amanote Research

Amanote Research

    RegisterSign In

Efficient Parallel Algorithms for a Class of Graph Theoretic Problems

SIAM Journal on Computing - United States
doi 10.1137/0213036
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsComputer Science
Date

August 1, 1984

Authors
Yung H. TsinFrancis Y. Chin
Publisher

Society for Industrial & Applied Mathematics (SIAM)


Related search

Graph-Theoretic Studies of Combinatorial Optimization Problems

English

Graph-Theoretic Problems and Their New Applications

Mathematics
Mathematics
2020English

Parallel Remapping Algorithms for Adaptive Problems

English

A New Graph Model and Algorithms for Consistent Superstring Problems

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
MathematicsEngineeringAstronomyPhysics
2014English

Efficient Parallel Circuits and Algorithms for Division

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

Algorithms for Weighted Graph Problems on the Modified Cellular Graph Automaton

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1989English

Design Patterns for Efficient Graph Algorithms in MapReduce

2010English

Faster Scaling Algorithms for General Graph Matching Problems

1989English

Parallel Algorithms for Zero-One Supply-Demand Problems

SIAM Journal on Discrete Mathematics
Mathematics
1989English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy