About: Linear-time Constant-ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs   Goto Sponge  NotDistinct  Permalink

An Entity of Type : owl:Thing, within Data Space : data.idref.fr associated with source document(s)

AttributesValues
Author
Bibliographic Citation
  • Gambette Philippe. Linear-time Constant-ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs. Seventh International Workshop on Algorithms and Computation, Feb 2013, Kharagpur, India. pp.126-136, ⟨10.1007/978-3-642-36065-7_13⟩
  • Gambette Philippe . Linear-time Constant-ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs . Seventh International Workshop on Algorithms and Computation, Feb 2013, Kharagpur, India . pp.126-136, ⟨10.1007/978-3-642-36065-7_13⟩
Title
  • Linear-time Constant-ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs
dc:date
  • 2013
Digital Object Identifier (DOI)
  • 10.1007/978-3-642-36065-7_13
Faceted Search & Find service v1.13.91 as of Aug 16 2018


Alternative Linked Data Documents: ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of May 14 2019, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (70 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software