Automatically Generated Algorithms for the Vertex Coloring Problem

PLoS ONE - United States
doi 10.1371/journal.pone.0058551
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Public Library of Science (PLoS)

Related search

Improved Algorithms for the 2-Vertex Disjoint Paths Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Automatically Produced Algorithms for the Generalized Minimum Spanning Tree Problem

Scientific Programming
Computer Science ApplicationsSoftware
2016English

An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
2005English

Strong Vertex-Distinguishing Total Coloring Algorithm for Complete Graphs Based on Equitable Coloring

Journal of Engineering Science and Technology Review
Engineering
2020English

New Approximation Algorithms for Graph Coloring

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1994English

On R - Dynamic Vertex Coloring of Some Graphs

Kongunadu Research Journal
2020English

Acyclic Vertex Coloring of Graphs of Maximum Degree 5

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2011English

Vertex Distinguishing General-Total Coloring of K2, 5, P

Scholars Journal of Physics, Mathematics and Statistics
2020English

Testing the Actual Equivalence of Automatically Generated Items

Behavior Research Methods
DevelopmentalArtsPsychologyEducational PsychologyCognitive PsychologyHumanitiesExperimental
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy