Inclusion-exclusion and network reliability.
Dohmen, Klaus (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Improved inclusion-exclusion identities and inequalities based on a particular class of abstract tubes.”
Inclusion-exclusion and network reliability.
On sums over partially ordered sets.
Dohmen, Klaus (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Reliability of communication networks with delay constraints: computational complexity and complete topologies.
Cancela, H., Petingi, L. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Branching programs provide lower bounds on the area of VLSI circuits
Juraj Hromkovič (1991)
Kybernetika
Similarity:
Scheduled hot-potato routing.
Naor, Joseph, Orda, Ariel, Rom, Raphael (1998)
Journal of Graph Algorithms and Applications
Similarity:
Strong edge geodetic problem in networks
Paul Manuel, Sandi Klavžar, Antony Xavier, Andrew Arokiaraj, Elizabeth Thomas (2017)
Open Mathematics
Similarity:
Geodesic covering problems form a widely researched topic in graph theory. One such problem is geodetic problem introduced by Harary et al. [Math. Comput. Modelling, 1993, 17, 89-95]. Here we introduce a variation of the geodetic problem and call it strong edge geodetic problem. We illustrate how this problem is evolved from social transport networks. It is shown that the strong edge geodetic problem is NP-complete. We derive lower and upper bounds for the strong edge geodetic number...
On recursively directed hypercubes.
Domshlak, Carmel (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions.
Czabarka, Éva, Sýkora, Ondrej, Székely, László A., Vrt'o, Imrich (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Some inequalities for modified Bessel functions.
Laforgia, Andrea, Natalini, Pierpaolo (2010)
Journal of Inequalities and Applications [electronic only]
Similarity:
A computational perspective on network coding.
Guo, Qin, Luo, Mingxing, Li, Lixiang, Yang, Yixian (2010)
Mathematical Problems in Engineering
Similarity:
Towards optimal formwork pairing on construction sites
Thierry Benoist (2007)
RAIRO - Operations Research
Similarity:
Minimizing shutterings assembling time on construction sites can yield significant savings in labor costs and crane moves. It requires solving a pairing problem that optimizes the ability for the crane to move chains of shutterings as a whole when they can be later reused together to frame another wall of the site. In this paper, we show that this problem is NP-hard in the strong sense as well as both its multiflow and ordering aspects. We also introduce a linear relaxation that computes...