A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
The bandwidth sum of join and composition of graphs
2005
Discrete Mathematics
Preserved Fulltext
Acknowledgements The authors would like to thank the referees for many constructive suggestions. ...
And, in the last section, we propose some problems that remain unsolved.
The bandwidth sum of the join of graphs We consider the bandwidth sum of join of graphs in this section. ...
Bandwidth sum of composition of graphs In this section, we consider the bandwidth sum of those graphs P m [G] and C m [G], where G is a union of isolated vertices, a path, or a cycle. ...
doi:10.1016/j.disc.2004.10.008
fatcat:7kdu3cmuangttjhbuu6jkdhery
Contents
2005
Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Kuo and J.-H. Yan The bandwidth sum of join and composition of graphs 145 CommunicationA.N. Glebov, A.V. Kostochka and V.A. ...
Ranjan
Identity orientation of complete bipartite graphs
173
H. Kerivin and A.R. Mahjoub
On survivable network polyhedra
183
H. Li and J. Shu
The partition of a strong tournament
211
H. ...
doi:10.1016/s0012-365x(05)00039-7
fatcat:mqea4427q5ggrm7idwzkfmi5ky
Page 5674 of Mathematical Reviews Vol. , Issue 93j
[page]
1993
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The problem of minimizing the task’s execution time is transformed into the problem of writing the task matrix as the sum of a minimum number of permutation matrices. ...
“In this paper, we introduce an algorithm, called the join al- gorithm, which takes nonempty coteries, as input, and returns a new, larger coterie. The new coterie is called a composite coterie. ...
Page 7571 of Mathematical Reviews Vol. , Issue 98M
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
7571
lower bound for the bandwidth of the composition of two graphs, and then they use this lower bound to determine the bandwidths of several classes of composition graphs such as (P, x P,)[H], (P, x ...
Let min(M ), max(M), and 5“(M) denote the length of the shortest edge, the length of the longest edge, and the sum of the lengths of the edges of M, respectively. ...
Optimum shape and size of slots for TE21 tracking mode coupler
2011
IEICE Electronics Express
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The optimum size and shape of side wall slots has 20%, 3 dB transmission bandwidth. ...
This paper presents the effects of shape and size of slots on sidewall coupling. A prototype x band mode converter with rounded-end shaped slots is built and tested. ...
The length of overmoded circular waveguide causes resonant dips and ohmic loss [5] . When the two conductors joined together, they form a cavity and the dips are formed by resonance of cavity. ...
doi:10.1587/elex.8.657
fatcat:dr3fq5ddt5g47dzma65cgzpfky
On Exploring Performance Optimizations in Web Service Composition
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The importance of service composition has been widely recognized in the Internet research community due to its high flexibility in allowing development of customized applications from primitive services ...
Service composition in the wide area actually creates a new type of routing problem which we call QoS service routing. ...
Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of the awarding agencies. ...
doi:10.1007/978-3-540-30229-2_7
fatcat:5oanjuqe6ndxzg63fukgd2d3em
P2P Live Streaming Towards Best Video Quality
2008
2008 5th IEEE Consumer Communications and Networking Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
While the overall bandwidth of peer-to-peer live video streaming system scales automatically as peers collectively contribute the bandwidth, each peer also demands to download at the specified video playback ...
Therefore, a fundamental problem arisen is how to balance the bandwidth supply and demand in the peer-to-peer system to enjoy peers with the best video quality. ...
The work at Hong Kong University of Science and Technology is supported by Huawei Technologies Co., Ltd. through contract Huawei 003.06/07. ...
doi:10.1109/ccnc08.2007.108
dblp:conf/ccnc/LuanKHT08
fatcat:bjnvvhxptvcq7burvs6c4ezlly
Page 8501 of Mathematical Reviews Vol. , Issue 2004k
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The present paper is the study of properties of M-strong fuzzy graphs. It is proved that the Cartesian product, the composition and the join of such graphs are also M-strong. ...
The weight of each vertex (edge) is the sum of its label and the labels of all its incident edges (the edge and its two end vertices). ...
Bandwidth of the composition of two graphs
2003
Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we investigate the bandwidth of the composition of two graphs. Let G be a connected graph. We denote the diameter of G by D(G). ...
Moreover, we show that this result determines the bandwidth of the composition of some classes of graphs composed with any graph. ...
Acknowledgements The author thanks the referees for their valuable suggestions. ...
doi:10.1016/s0012-365x(03)00131-6
fatcat:yeqeozyw6bbgfp7dw2b6kqimmq
Some parallel algorithms on interval graphs
1987
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Parallel algorithms are also given for finding a Hamiltonian circuit and the minimum bandwidth of a proper interval graph. ...
Parallel algorithms are given for finding a maximum weighted clique, a maximum weighted independent set, a minimum clique cover, and a minimum weighted dominating set of an interval graph. ...
A graph is a (proper) interval graph if there is a one-to-one correspondence between the nodes of the graph and the intervals of a (proper) interval family such that two nodes of the graph are joined by ...
doi:10.1016/0166-218x(87)90068-0
fatcat:fp74fnm5jbh5bhzhyc52y2vnfa
Bisection width of transposition graphs
1998
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The results have applications to VLSI layouts, cutwidth and crossing numbers of transposition graphs. We also study bandwidth of these graphs. 0 ...
which solves the open problem (R) 3.356 of Leighton's book [IO] and determine an asymptotically exact value of bisection width of the star graph. ...
Bandwidths of transposition graphs In this section we prove a general upper bound on the bandwidth of transposition graphs. ...
doi:10.1016/s0166-218x(98)00009-2
fatcat:7yzpcblxxzfojaymuhvrdarao4
Large-Scale QoS-Aware Service-Oriented Networking with a Clustering-Based Approach
2007
2007 16th International Conference on Computer Communications and Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Motivated by the fact that most of the existing QoS service composition solutions have limited scalability, we develop a hierarchical-based solution framework to achieve scalability by means of topology ...
The paper presents and solves several unique challenges associated with the hierarchical-based QoS service composition solution in overlay networks, including topology formation (cluster detection and ...
of instances covered in the area. 4 Assume two services s 1 and s 2 are advertised with access bandwidths of bw 1 and bw 2 , then we can estimate that the end-to-end bandwidth is upbounded by min(bw ...
doi:10.1109/icccn.2007.4317872
dblp:conf/icccn/JinLJN07
fatcat:5dydfauyabb3xgqy2gbpvyj5oi
Optimization Strategies for Integration Pattern Compositions
2018
Proceedings of the 12th ACM International Conference on Distributed and Event-based Systems - DEBS '18
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In order to achieve this, we formalize compositions of Enterprise Integration Patterns based on their characteristics, and propose a realization of optimization strategies using graph rewriting. ...
Enterprise Application Integration is the centerpiece of current on-premise, cloud and device integration scenarios. ...
ACKNOWLEDGMENTS We thank Jonas Kandels for implementation support, and the anonymous reviewers for suggestions and comments. ...
doi:10.1145/3210284.3210295
dblp:conf/debs/0001MFR18
fatcat:af4l2gt4hbfjpphdnedswiv5qe
REX
2012
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We seek to unify the strengths of both styles of platforms, with a focus on supporting iterative computations in which changes, in the form of deltas, are propagated from iteration to iteration, and state ...
We experimentally validate our techniques, and show speedups over the competing methods ranging from 2.5 to nearly 100 times. ...
SQL has many of the features desired in a high-level MapReduce abstraction: composition, joins, and even support for recursive queries. ...
doi:10.14778/2350229.2350246
fatcat:pfzv4hkikjgjzcwwt5hv6gg4vi
REX: Recursive, Delta-Based Data-Centric Computation
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We seek to unify the strengths of both styles of platforms, with a focus on supporting iterative computations in which changes, in the form of deltas, are propagated from iteration to iteration, and state ...
We experimentally validate our techniques, and show speedups over the competing methods ranging from 2.5 to nearly 100 times. ...
SQL has many of the features desired in a high-level MapReduce abstraction: composition, joins, and even support for recursive queries. ...
arXiv:1208.0089v1
fatcat:kc55jzf3e5fqlme5xxwkrqplu4
« Previous
Showing results 1 — 15 out of 6,073 results