z-logo
open-access-imgOpen Access
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study
Author(s) -
Tesshu Hanaka,
Yasuaki Kobayashi,
Kazuhiro Kurita,
See Woo Lee,
Yota Otachi
Publication year - 2022
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v36i4.20290
Subject(s) - matroid , bipartite graph , time complexity , combinatorics , pairwise comparison , mathematics , hamming distance , integer (computer science) , computer science , matching (statistics) , discrete mathematics , algorithm , graph , artificial intelligence , statistics , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom