Login / Signup
Tournaments whose indecomposability graph admits a vertex cover of size 2.
Imed Boudabbous
Published in:
Ars Comb. (2016)
Keyphrases
</>
vertex cover
planar graphs
brute force search
maximum clique
approximation algorithms
constant factor
graph theory
partial order
directed acyclic graph
random walk
weighted graph
np hard
directed graph
social networks
undirected graph
theoretical analysis
search space
computational complexity