Algorithms solving path systems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Al gorithms recognizing solvable path systems are presented and their time complexity is investigated. Among them there is an algorithm with a constant expected behaviour.

Original languageEnglish (US)
Title of host publicationFundamentals of Computation Theory - FCT 1985
EditorsLothar Budach
PublisherSpringer Verlag
Pages70-79
Number of pages10
ISBN (Print)9783540156895
DOIs
StatePublished - Jan 1 1985
Externally publishedYes
Event5th International Conference on Fundamentals of Computation Theory, FCT 1985 - Cottbus, Germany
Duration: Sep 9 1985Sep 13 1985

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume199 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Fundamentals of Computation Theory, FCT 1985
CountryGermany
CityCottbus
Period9/9/859/13/85

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Algorithms solving path systems'. Together they form a unique fingerprint.

  • Cite this

    Chlebus, B. S. (1985). Algorithms solving path systems. In L. Budach (Ed.), Fundamentals of Computation Theory - FCT 1985 (pp. 70-79). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 199 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0028793