Computing all-pairs shortest paths by leveraging low treewidth

LR Planken; MM de Weerdt; PJ van der Krogt

Computing all-pairs shortest paths by leveraging low treewidth

LR Planken, MM de Weerdt, PJ van der Krogt

Algorithmics

Research output: Contribution to journal › Article › Scientific › peer-review

Original language	English
Pages (from-to)	353-388
Number of pages	36
Journal	The Journal of Artificial Intelligence Research
Volume	43
Publication status	Published - 2012

Keywords

CWTS 0.75 <= JFIS < 2.00

Cite this

@article{ba0f87e7b6534a0e99a6993ad8287dac,

title = "Computing all-pairs shortest paths by leveraging low treewidth",

keywords = "CWTS 0.75 <= JFIS < 2.00",

author = "LR Planken and {de Weerdt}, MM and {van der Krogt}, PJ",

year = "2012",

language = "English",

volume = "43",

pages = "353--388",

journal = "The Journal of Artificial Intelligence Research",

issn = "1076-9757",

publisher = "Morgan Kaufmann Publishers",

}

TY - JOUR

T1 - Computing all-pairs shortest paths by leveraging low treewidth

AU - Planken, LR

AU - de Weerdt, MM

AU - van der Krogt, PJ

PY - 2012

Y1 - 2012

KW - CWTS 0.75 <= JFIS < 2.00

UR - http://www.jair.org/papers/paper3509.html

M3 - Article

SN - 1076-9757

VL - 43

SP - 353

EP - 388

JO - The Journal of Artificial Intelligence Research

JF - The Journal of Artificial Intelligence Research

ER -

Computing all-pairs shortest paths by leveraging low treewidth

Keywords

Other files and links

Network instance Chordal, fixed size, edition 2

Network instance Diamonds, edition 2

Network instance New York, edition 2

Cite this

Computing all-pairs shortest paths by leveraging low treewidth

Keywords

Other files and links

Datasets

Network instance Chordal, fixed size, edition 2

Network instance Diamonds, edition 2

Network instance New York, edition 2

Cite this