Characterization of Efficiently Parallel Solvable Problems on a Class of Decomposable Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-24685-5_28
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1995English

Fully Decomposable Split Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Efficient Parallel Algorithms for a Class of Graph Theoretic Problems

SIAM Journal on Computing
MathematicsComputer Science
1984English

A Note on Solvable Vertex Stabilizers of S-Transitive Graphs of Prime Valency

Czechoslovak Mathematical Journal
Mathematics
2015English

On a Characterization of Planar Graphs

Bulletin of the Australian Mathematical Society
Mathematics
1981English

Vertex-Transitive Graphs of Prime-Squared Order Are Hamilton-Decomposable

Journal of Combinatorial Designs
CombinatoricsDiscrete Mathematics
2013English

On Symmetries of Crystals With Defects Related to a Class of Solvable Groups (S1)

Mathematics and Mechanics of Solids
Mechanics of MaterialsMaterials ScienceMathematics
2011English

A Class of Weakly Perfect Graphs

Czechoslovak Mathematical Journal
Mathematics
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy