Login / Signup
(Nearly-)tight bounds on the contiguity and linearity of cographs.
Christophe Crespelle
Philippe Gambette
Published in:
Theor. Comput. Sci. (2014)
Keyphrases
</>
tight bounds
upper bound
graph partitioning
viewpoint
information retrieval
pattern recognition
lower bound
multiresolution
d objects
multi class