Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract).
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/tamc/LangerRS11
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/tamc/LangerRS11
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Alexander_Langer
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Rossmanith
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Somnath_Sikdar
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-642-20877-5%5F49
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-642-20877-5_49
>
dc:
identifier
DBLP conf/tamc/LangerRS11
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-642-20877-5%5F49
(xsd:string)
dcterms:
issued
2011
(xsd:gYear)
rdfs:
label
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract).
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Alexander_Langer
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Rossmanith
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Somnath_Sikdar
>
swrc:
pages
505-516
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/tamc/2011
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/tamc/LangerRS11/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/tamc/LangerRS11
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/tamc/tamc2011.html#LangerRS11
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-642-20877-5_49
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/tamc
>
dc:
title
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract).
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document