Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs.

Andrzej Lingas Martin Wahlen

Published in: COCOON (2003)

Keyphrases

related problems
graph theory
maximum independent set
computationally efficient
learning algorithm
data structure
broadly applicable
computational cost
optimization problems
social networks
random graphs
range searching