About: Connectivity check in 3-connected planar graphs with obstacles   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
  • Courcelle Bruno, Gavoille Cyril, Kanté Mamadou Moustapha, Twigg Andrew. Connectivity check in 3-connected planar graphs with obstacles. Electronic Notes in Discrete Mathematics, Elsevier, 2008, 31, pp.151-155. ⟨10.1016/j.endm.2008.06.030⟩
Title
  • Connectivity check in 3-connected planar graphs with obstacles
dc:date
  • 2008
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-2024 OpenLink Software