Complexity Analysis of a Decentralised Graph Colouring Algorithm

Information Processing Letters - Netherlands
doi 10.1016/j.ipl.2008.01.002
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

A Wide-Ranging Computational Comparison of High-Performance Graph Colouring Algorithms

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2012English

A Brief Note on Acyclic Colouring of Line Graph of Some Families

International Journal of Computer Applications
2013English

A Method of Lowering the Complexity of the Sum-Product Algorithm Using Graph Transformations

English

Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Neural Complexity: A Graph Theoretic Interpretation

Physical Review E
2011English

Complexity of Cocktail Party Graph and Crown Graph

American Journal of Applied Sciences
Multidisciplinary
2012English

Exploring the Effects of Colouring Graph Diagrams on People of Various Backgrounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs

Computer Journal
Computer Science
2015English

Evolution of a Functionally Diverse Swarm via a Novel Decentralised Quality-Diversity Algorithm

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy