[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/FeldmanR99>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Jon_Feldman>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Matthias_Ruhl>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FSFFCS.1999.814601>
foaf:homepage <https://doi.org/10.1109/SFFCS.1999.814601>
dc:identifier DBLP conf/focs/FeldmanR99 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FSFFCS.1999.814601 (xsd:string)
dcterms:issued 1999 (xsd:gYear)
rdfs:label The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Jon_Feldman>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Matthias_Ruhl>
swrc:pages 299-308 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/1999>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/FeldmanR99/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/FeldmanR99>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs99.html#FeldmanR99>
rdfs:seeAlso <https://doi.org/10.1109/SFFCS.1999.814601>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject Directed Steiner Network, Point-to-Point Connection Problem, Strongly Connected Steiner Subgraph, polynomial-time algorithms, network design, directed graphs (xsd:string)
dc:title The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document