Finding the Shortest Path with Vertex Constraint over Large Graphs

Complexity 2019:1-13 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,897

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The complexity of recursive constraint satisfaction problems.Victor W. Marek & Jeffrey B. Remmel - 2010 - Annals of Pure and Applied Logic 161 (3):447-457.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Domatic partitions of computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
Expansions of Ultrahomogeneous Graphs.J. E. Helmreich - 1995 - Notre Dame Journal of Formal Logic 36 (3):414-424.
Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
On the Complexity of Alpha Conversion.Rick Statman - 2007 - Journal of Symbolic Logic 72 (4):1197 - 1203.
Forbidden subgraphs and forbidden substructures.Gregory Cherlin & Niandong Shi - 2001 - Journal of Symbolic Logic 66 (3):1342-1352.
Forbidden Subgraphs and Forbidden Substructures.Gregory Cherlin & Niandong Shi - 2001 - Journal of Symbolic Logic 66 (3):1342-1352.

Analytics

Added to PP
2019-02-20

Downloads
18 (#832,892)

6 months
6 (#520,798)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references