Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1987: Automata, Languages and Programming pp 404–424Cite as

Posets, boolean representations and quick path searching

  • Algorithms And Complexity
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 267))

Abstract

The aim of this paper is twofold: first, the concept of boolean dimension of posets is introduced and its relevance is discussed in the representation of posets and transitive closure of dags by means of labeling of nodes and boolean formulae defined on order predicates between pairs of labels.

Second, such concept is used in the framework of efficient searching for a path between two nodes in a given acyclic digraph G (with n nodes and m arcs), obtaining a query time 0(k·l·lgcn) and a corresponding space complexity 0(k(n+m lgn)lgcn), where c is a suitable constant, k≤n is a parameter related to the length of the formula and l is the length of the resulting path, which behaves favorably compared to the best known results in the case of k bounded by √n: such result is obtained via the use of a data structure derived from Segment trees and Cartesian trees.

Some interesting classes of dags are finally presented for which query time and space complexity 0(l·lgcn) and 0((n+m lgcn) respectively can be obtained.

Finally, as a side result, a simple algorithm for path searching for dags with indegree or outdegree bounded by a constant is presented which has time complexity 0(f·l) and space complexity 0(n·t+f), where f is the length of the boolean formula and t is the number of variables in the formula.

Partially supported by the ALPES Esprit Project

This work was done while J. Nešetřil was visiting I.A.S.I.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Ausiello, A.D'Atri, M. Moscarini: Chordality properties on graph and minimal conceptual connections in semantic data models, Journal of Computer and System Sciences, 33, (1986).

    Google Scholar 

  2. J.L. Bentley: Algorithms for Klee's rectangle problems, Carnegie-Mellon University, Pittsburgh, Penn., Dept. of Computer Science, unpublished notes, (1977).

    Google Scholar 

  3. K. Cameron: On k-optimum dipath partitions and partial k-colourings of acyclic digraphs, Europ. J. Combinatorics, 7, 115–118, (1986).

    Google Scholar 

  4. D.W. Davies, D.L. Barber: Communication networks for computers, Wiley Interscience, New York, (1973).

    Google Scholar 

  5. B. Dushnik, E. Miller: Partially ordered sets, Amer. J. Math., 63, 600–610, (1941).

    Google Scholar 

  6. H. Frank, I.T. Frish: Communication, transmission and transportation networks, Addison-Wesley, Reading, (1971).

    Google Scholar 

  7. M.L. Fredman, R.E. Tarjan: Fibonacci heaps and their use in improved network optimization problems, 25th Symp. on Foundations of Computer Science, 338–346, (1984).

    Google Scholar 

  8. H.N. Gabow, J.L. Bentley, R.E. Tarjan: Scaling and related techniques for geometry problems, 16th Symp. on Theory of Computing, 135–143, (1984).

    Google Scholar 

  9. G. Gambosi, J. Nešetřil, M. Talamo: Efficient representation of taxonomies, TAPSOFT-CAAP Conference, Pisa, Italy, (1987).

    Google Scholar 

  10. G. Gambosi, J. Nešetřil, M. Talamo: On locally presented posets, submitted to "Theoretical Computer Science".

    Google Scholar 

  11. G. Gambosi, M. Talamo: Locally presented posets as a tool for representing advanced data structures, IASI-CNR internal report R. 141, (1985).

    Google Scholar 

  12. F.P. Preparata, M.I. Shamos: Computational Geometry, an introduction, Springer-Verlag, New York, (1985).

    Google Scholar 

  13. P. Pudlák, J. Nešetřil: A note on boolean dimension of posets, "Irregularities and partitions" Conference, Fertöd, Hungary, (1986).

    Google Scholar 

  14. I. Rival: Linear extensions of finite ordered sets, Annals of Discrete Math., 23, 355–370, (1984).

    Google Scholar 

  15. J.F. Sowa: Conceptual structures; Information processing in mind and machine, Addison-Wesley, Reading, (1984).

    Google Scholar 

  16. W. Trotter, J. Moore: The dimension of planar posets, J. Combinatorial Theory (B), 22, 54–67, (1984).

    Google Scholar 

  17. M. Yannakakis: Four pages are necessary and sufficient for planar graphs, 18th Symp. on Theory of Computing, 104–108, (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. I.A.S.I.-C.N.R., V. le Manzoni 30, 00185, Rome, Italy

    G. Gambosi & M. Talamo

  2. Charles University, Malostranské Nám. 25, 11800, Prague 1, Czechoslovakia

    J. Nešetřil

Authors
  1. G. Gambosi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Nešetřil
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Talamo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Thomas Ottmann

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gambosi, G., Nešetřil, J., Talamo, M. (1987). Posets, boolean representations and quick path searching. In: Ottmann, T. (eds) Automata, Languages and Programming. ICALP 1987. Lecture Notes in Computer Science, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18088-5_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-18088-5_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18088-3

  • Online ISBN: 978-3-540-47747-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation