Using Maximal Independent Sets to Solve Problems in Parallel

Theoretical Computer Science - Netherlands
doi 10.1016/0304-3975(94)00221-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Maximal K-Independent Sets in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

Chromatic Number in Time O(2.4023^n) Using Maximal Independent Sets

BRICS Report Series
2002English

Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets

Journal of Algorithms
1993English

Using Term Rewriting to Solve Bit-Vector Arithmetic Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Using Unmanned Aerial Vehicles to Solve Some Civil Problems

Cases on Modern Computer Systems in Aviation
2019English

On Sets Related to Maximal Clones

Discussiones Mathematicae - General Algebra and Applications
Applied MathematicsNumber TheoryAlgebra
2012English

Using DEA-neural Network Approach to Solve Binary Classification Problems

Data Envelopment Analysis and Decision Science
2013English

Using Boolean Computation to Solve Some Problems From Ramsey Theory

The Mathematica Journal
2013English

Using Harmonic Mean to Solve Multi-Objective Linear Programming Problems

American Journal of Operations Research
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy