2009
AUTHORS ABSTRACTWe give the first known optimal algorithm that computes a minimum cycle basis for any weighted outerplanar graph. Specifically, for any n-node edge-weighted outerplanar graph G, we give an O(n)-time algorithm to obtain an O(n)-space compact representation Z(ℂ) for a minimum cycle basis ℂ of G. Each cycle in ℂ can be computed from Z(ℂ) in O(1) time per edge. Our result works for directed and undirected outerplanar graphs G. More... »
PAGES564-572
Algorithms and Computation
ISBN
978-3-642-10630-9
978-3-642-10631-6
http://scigraph.springernature.com/pub.10.1007/978-3-642-10631-6_58
DOIhttp://dx.doi.org/10.1007/978-3-642-10631-6_58
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1047255176
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information and Computing Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Computation Theory and Mathematics",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Department of Computer Science and Information Engineering, National Taiwan University",
"id": "http://www.grid.ac/institutes/grid.19188.39",
"name": [
"Department of Computer Science and Information Engineering, National Taiwan University"
],
"type": "Organization"
},
"familyName": "Liu",
"givenName": "Tsung-Hao",
"id": "sg:person.0620511425.57",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0620511425.57"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science and Information Engineering, National Taiwan University",
"id": "http://www.grid.ac/institutes/grid.19188.39",
"name": [
"Department of Computer Science and Information Engineering, National Taiwan University"
],
"type": "Organization"
},
"familyName": "Lu",
"givenName": "Hsueh-I.",
"id": "sg:person.013345515575.46",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013345515575.46"
],
"type": "Person"
}
],
"datePublished": "2009",
"datePublishedReg": "2009-01-01",
"description": "We give the first known optimal algorithm that computes a minimum cycle basis for any weighted outerplanar graph. Specifically, for any n-node edge-weighted outerplanar graph G, we give an O(n)-time algorithm to obtain an O(n)-space compact representation Z(\u2102) for a minimum cycle basis \u2102 of G. Each cycle in \u2102 can be computed from Z(\u2102) in O(1) time per edge. Our result works for directed and undirected outerplanar graphs G.",
"editor": [
{
"familyName": "Dong",
"givenName": "Yingfei",
"type": "Person"
},
{
"familyName": "Du",
"givenName": "Ding-Zhu",
"type": "Person"
},
{
"familyName": "Ibarra",
"givenName": "Oscar",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-642-10631-6_58",
"inLanguage": "en",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-642-10630-9",
"978-3-642-10631-6"
],
"name": "Algorithms and Computation",
"type": "Book"
},
"keywords": [
"minimum cycle basis",
"outerplanar graphs",
"outerplanar graph G",
"optimal algorithm",
"graph G",
"cycle basis",
"time algorithm",
"graph",
"compact representation",
"algorithm",
"representation",
"edge",
"basis",
"results",
"time",
"cycle"
],
"name": "Minimum Cycle Bases of Weighted Outerplanar Graphs",
"pagination": "564-572",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1047255176"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-642-10631-6_58"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-642-10631-6_58",
"https://app.dimensions.ai/details/publication/pub.1047255176"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-20T07:46",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_315.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-642-10631-6_58"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-10631-6_58'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-10631-6_58'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-10631-6_58'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-10631-6_58'
This table displays all metadata directly associated to this object as RDF triples.
93 TRIPLES
23 PREDICATES
42 URIs
35 LITERALS
7 BLANK NODES