Login / Signup
Ultimate greedy approximation of independent sets in subcubic graphs.
Piotr Krysta
Mathieu Mari
Nan Zhi
Published in:
CoRR (2020)
Keyphrases
</>
directed acyclic graph
markov equivalence classes
directed graph
closed form
undirected graph
approximation error
upper approximation
pattern recognition
approximation algorithms
convex sets
approximation spaces
genetic algorithm
search algorithm
error bounds
graph model
hypervolume indicator