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”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Benzaken, C., Hammer, P.L., de Werra, D.: Threshold characterization of graphs with Dilworth number two. J. Graph Theory 9, 245–267 (1985)
Chvátal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. Ann. Discrete Math. 1, 145–162 (1977)
Cogis, O.: Ferrers digraphs and threshold graphs. Discrete Math. 38, 33–46 (1982)
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)
Henderson, P.B., Zalcstein, Y.: A graph-theoretic characterization of the \(PV_{chunk}\) class of synchronizing primitives. SIAM J. Comput. 6, 88–108 (1977)
Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics, Ann. Discrete Math., vol. 56, North-Holland (1995)
Orlin, J.: The minimal integral separator of a threshold graph. Ann. Discrete Math. 1, 415–419 (1977)
Shamir, R., Sharan, R.: A fully dynamic algorithm for modular decomposition and recognition of cographs. Discrete Appl. Math. 136, 329–340 (2004)
Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods 3, 351–358 (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)