Back to Results
First PageMeta Content
Tree decomposition / Interval graph / Floyd–Warshall algorithm / Neighbourhood / Clique / Split graph / Shortest path problem / Path decomposition / Degeneracy / Graph theory / Graph operations / Chordal graph


Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth
Add to Reading List

Document Date: 2012-03-19 16:09:33


Open Document

File Size: 2,20 MB

Share Result on Facebook

City

New York City / /

Company

Ford / Vertex / Simple Temporal Networks / Venable / /

Currency

pence / /

/

Facility

Delft University of Technology / University College Cork / /

IndustryTerm

point-to-point shortest path algorithm / road network / random scale-free networks / social networking / maximal cardinality search / hierarchical task networks / computing / transportation networks / Internet node traffic / triangulation algorithm / /

Organization

Faculty of EEMCS / AI Access Foundation / Cork Constraint Computation Centre / Delft University of Technology / /

Person

Satish Kumar / /

PublishedMedium

Journal of Artificial Intelligence Research / /

Technology

SSSP algorithm / bioinformatics / Warshall algorithm / so-called triangulation algorithm / artificial intelligence / Van der Krogt Algorithm / IPPC algorithm / APSP algorithm / 3 4 5 6 7 8 9 10 11 Algorithm / One algorithm / point-to-point shortest path algorithm / DPC-based APSP algorithm / proposed algorithms / DPC algorithm / /

SocialTag