Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-31104-8_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

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

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2012English

Deterministic Algorithms for the Lovász Local Lemma

SIAM Journal on Computing
MathematicsComputer Science
2013English

Flow-Based Algorithms for Local Graph Clustering

2013English

Complexity Analysis of a Decentralised Graph Colouring Algorithm

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

Monotonicity of Non-Deterministic Graph Searching

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2008English

About Non-Isomorphic Graph Colouring Generating by Read - Faradzhev Method

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

Deterministic Algorithms for Submodular Maximization Problems

2015English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Multi-Agent Deterministic Graph Mapping via Robot Rendezvous

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy