Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Algorithms and Computation

WALCOM 2016: WALCOM: Algorithms and Computation pp 313–324Cite as

Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9627))

Abstract

This paper deals with the well known classes of threshold and difference graphs, both characterized by separators, i.e. node weight functions and thresholds. We show how to maintain minimum the value of the separator when the input (threshold or difference) graph is fully dynamic, i.e. edges/nodes are inserted/removed. Moreover, exploiting the data structure used for maintaining the minimality of the separator, we handle the operations of disjoint union and join of two threshold graphs.

Partially supported by the Italian Ministry of Education and University, PRIN project “AMANDA: Algorithmics for MAssive and Networked DAta”.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Benzaken, C., Hammer, P.L., de Werra, D.: Threshold characterization of graphs with Dilworth number two. J. Graph Theory 9, 245–267 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chvátal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. Ann. Discrete Math. 1, 145–162 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cogis, O.: Ferrers digraphs and threshold graphs. Discrete Math. 38, 33–46 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  4. Heggernes, P., Papadopoulos, C.: Single-edge monitor sequences of graphs and linear-time algorithms for minimal completions and deletions. Theor. Comput. Sci. 410, 1–15 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Henderson, P.B., Zalcstein, Y.: A graph-theoretic characterization of the \(PV_{chunk}\) class of synchronizing primitives. SIAM J. Comput. 6, 88–108 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  6. Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics, Ann. Discrete Math., vol. 56, North-Holland (1995)

    Google Scholar 

  7. Orlin, J.: The minimal integral separator of a threshold graph. Ann. Discrete Math. 1, 415–419 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  8. Shamir, R., Sharan, R.: A fully dynamic algorithm for modular decomposition and recognition of cographs. Discrete Appl. Math. 136, 329–340 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods 3, 351–358 (1982)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, “Sapienza” University of Rome, Rome, Italy

    Tiziana Calamoneri, Angelo Monti & Rossella Petreschi

Authors
  1. Tiziana Calamoneri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Angelo Monti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rossella Petreschi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tiziana Calamoneri .

Editor information

Editors and Affiliations

  1. Dept. of Computer Science and Engin., Bangladesh Univ. of Engin. & Technol., Dhaka, Bangladesh

    Mohammad Kaykobad

  2. Dept. of Computer Science, Sapienza University of Rome, Rome, Italy

    Rossella Petreschi

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Calamoneri, T., Monti, A., Petreschi, R. (2016). Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. In: Kaykobad, M., Petreschi, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2016. Lecture Notes in Computer Science(), vol 9627. Springer, Cham. https://doi.org/10.1007/978-3-319-30139-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30139-6_25

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30138-9

  • Online ISBN: 978-3-319-30139-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation