Minimum Weakly Fundamental Cycle Bases Are Hard To Find. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/Rizzi09>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Romeo_Rizzi>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1007%2Fs00453-007-9112-8>
foaf:homepage	<https://doi.org/10.1007/s00453-007-9112-8>
dc:identifier	DBLP journals/algorithmica/Rizzi09 (xsd:string)
dc:identifier	DOI doi.org%2F10.1007%2Fs00453-007-9112-8 (xsd:string)
dcterms:issued	2009 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/algorithmica>
rdfs:label	Minimum Weakly Fundamental Cycle Bases Are Hard To Find. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Romeo_Rizzi>
swrc:number	3 (xsd:string)
swrc:pages	402-424 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/Rizzi09/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/algorithmica/Rizzi09>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica53.html#Rizzi09>
rdfs:seeAlso	<https://doi.org/10.1007/s00453-007-9112-8>
dc:subject	Graphs; Combinatorial optimization; Minimum cycle basis problem; Weakly fundamental cycle basis; Fundamental cycle basis; Approximation algorithm; Computational complexity (xsd:string)
dc:title	Minimum Weakly Fundamental Cycle Bases Are Hard To Find. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	53 (xsd:string)