scholarly journals Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number

2018 ◽  
Vol 54 (4) ◽  
pp. 768-778 ◽  
Author(s):  
Jakub Kwaśny ◽  
Jakub Przybyło
Keyword(s):  
Adjacent Vertex ◽  
Asymptotically Optimal ◽  
Optimal Bound ◽  
Choice Number

Trees without twin-leaves with smallest number of maximal independent sets

2020 ◽  
Vol 30 (1) ◽  
pp. 53-67 ◽  
Author(s):  
Dmitriy S. Taletskii ◽  
Dmitriy S. Malyshev
Keyword(s):  
Independent Sets ◽  
Adjacent Vertex ◽  
Maximal Independent Sets

AbstractFor any n, in the set of n-vertex trees such that any two leaves have no common adjacent vertex, we describe the trees with the smallest number of maximal independent sets.

scholarly journals Similar Vertices and Isomorphism Detection for Planar Kinematic Chains Based on Ameliorated Multi-Order Adjacent Vertex Assignment Sequence

2021 ◽  
Vol 34 (1) ◽  
Author(s):  
Liang Sun ◽  
Zhizheng Ye ◽  
Fuwei Lu ◽  
Rongjiang Cui ◽  
Chuanyu Wu
Keyword(s):  
Degree Of Freedom ◽  
Adjacent Vertex ◽  
Topological Graph ◽  
Innovative Design ◽  
Kinematic Chains ◽  
Effectiveness And Efficiency ◽  
Definition Of ◽  
Specific Definition

AbstractIsomorphism detection is fundamental to the synthesis and innovative design of kinematic chains (KCs). The detection can be performed accurately by using the similarity of KCs. However, there are very few works on isomorphism detection based on the properties of similar vertices. In this paper, an ameliorated multi-order adjacent vertex assignment sequence (AMAVS) method is proposed to seek out similar vertices and identify the isomorphism of the planar KCs. First, the specific definition of AMAVS is described. Through the calculation of the AMAVS, the adjacent vertex value sequence reflecting the uniqueness of the topology features is established. Based on the value sequence, all possible similar vertices, corresponding relations, and isomorphism discrimination can be realized. By checking the topological graph of KCs with a different number of links, the effectiveness and efficiency of the proposed method are verified. Finally, the method is employed to implement the similar vertices and isomorphism detection of all the 9-link 2-DOF(degree of freedom) planar KCs.

scholarly journals Asymptotically optimal cubature formulas on manifolds for prefixed weights

2021 ◽  
pp. 105632
Author(s):  
Martin Ehler ◽  
Ujué Etayo ◽  
Bianca Gariboldi ◽  
Giacomo Gigante ◽  
Thomas Peter
Keyword(s):  
Asymptotically Optimal ◽  
Cubature Formulas

Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes

2012 ◽  
Vol 58 (2) ◽  
pp. 1163-1185 ◽  
Author(s):  
Reza Omrani ◽  
Gagan Garg ◽  
P. Vijay Kumar ◽  
Petros Elia ◽  
Pankaj Bhambhani
Keyword(s):  
Two Dimensional ◽  
Asymptotically Optimal ◽  
Optical Orthogonal Codes ◽  
Orthogonal Codes ◽  
Large Families

ON THE AVERAGE CASE CIRCUIT DELAY OF DISJUNCTION

1995 ◽  
Vol 05 (02) ◽  
pp. 275-280 ◽  
Author(s):  
BEATE BOLLIG ◽  
MARTIN HÜHNE ◽  
STEFAN PÖLT ◽  
PETR SAVICKÝ
Keyword(s):  
Lower Bounds ◽  
Wide Class ◽  
Time Complexity ◽  
Upper And Lower Bounds ◽  
Average Case ◽  
Asymptotically Optimal ◽  
Circuit Delay ◽  
Suitable Measure

For circuits the expected delay is a suitable measure for the average case time complexity. In this paper, new upper and lower bounds on the expected delay of circuits for disjunction and conjunction are derived. The circuits presented yield asymptotically optimal expected delay for a wide class of distributions on the inputs even when the parameters of the distribution are not known in advance.

An asymptotically optimal greedy algorithm for large optical burst switching systems

2003 ◽  
Vol 31 (2) ◽  
pp. 14-16 ◽  
Author(s):  
Lachlan L. H. Andrew ◽  
Yuliy Baryshnikov ◽  
E. G. Coffman ◽  
Stephen V. Hanly ◽  
Jolyon White
Keyword(s):  
Greedy Algorithm ◽  
Optical Burst Switching ◽  
Switching Systems ◽  
Asymptotically Optimal ◽  
Burst Switching ◽  
Optical Burst
Sign in / Sign up

Export Citation Format

Share Document