Constarium
← Search

Data · dataset · 2011

Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Chordal, fixed size (Figure 1)

Listed in DataCite

Chordal graphs from a self-written generator.

Description

The weights of the constraint arcs are set such that at least one solution exists (i.e. the graph contains no negative cycles and the STN is consistent). This archive contains 400 graphs on 200 nodes, 985–19900 arcs, treewidth 5–199.

Parent item: Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2011)]

Links

Where it is published

Documentation and papers

Catalogue records · 2

Topics

Inferred from text
Theory of computation 73%
Provenance · 1 source records, 7 field assertions
SourceKeyLast seenRaw
DataCite10.4121/uuid:413dcbe0-99f1-4f27-a8c0-28b529c0a6d911 d agoJSON v1
FieldAssertionExtractorEvidence
concepts[field].anzsrc:group:4613enrichment · DataCitetaxonomy-embedding@1.1.0title+keywords+description (73%)
concepts[field].fos:computer-and-information-sciencessource · DataCiteconnector:datacite@1.0.0
descriptionsource · DataCiteconnector:datacite@1.0.0/data/attributes/descriptions
license_textsource · DataCiteconnector:datacite@1.0.0
publication_datesource · DataCiteconnector:datacite@1.0.0/data/attributes/dates
titlesource · DataCiteconnector:datacite@1.0.0/data/attributes/titles/0/title
version_labelsource · DataCiteconnector:datacite@1.0.0