[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/mst/AllenderBCDR09>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/David_A._Mix_Barrington>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Eric_Allender>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Sambuddha_Roy>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Samir_Datta>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Tanmoy_Chakraborty_0001>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs00224-009-9172-z>
foaf:homepage <https://doi.org/10.1007/s00224-009-9172-z>
dc:identifier DBLP journals/mst/AllenderBCDR09 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs00224-009-9172-z (xsd:string)
dcterms:issued 2009 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/mst>
rdfs:label Planar and Grid Graph Reachability Problems. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/David_A._Mix_Barrington>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Eric_Allender>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Sambuddha_Roy>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Samir_Datta>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Tanmoy_Chakraborty_0001>
swrc:number 4 (xsd:string)
swrc:pages 675-723 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/mst/AllenderBCDR09/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/mst/AllenderBCDR09>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/mst/mst45.html#AllenderBCDR09>
rdfs:seeAlso <https://doi.org/10.1007/s00224-009-9172-z>
dc:subject Planar graphs; Grid graphs; Reachability; Circuit complexity; Logspace; Algorithms; Complexity theory (xsd:string)
dc:title Planar and Grid Graph Reachability Problems. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 45 (xsd:string)