Thrackles: An improved upper bound
نویسندگان
چکیده
منابع مشابه
An Improved Upper Bound for SAT
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1/α) up to a polynomial factor, where α = ln(m/n) + O(ln lnm) and n, m are respectively the number of variables and the number of clauses in the input formula. This bound is asymptotically better than the previously best ...
متن کاملAn Upper Bound Analysis of Sandwich Sheet Rolling Process
In this research, flat rolling process of bonded sandwich sheets is investigated by the method of upper bound. A kinematically admissible velocity field is developed for a single layer sheet and is extended into the rolling of the symmetrical sandwich sheets. The internal, shear and frictional power terms are derived and they are used in the upper bound model. Through the analysis, the rolling ...
متن کاملAn Improved General Upper Bound for All-Terminal Network Reliability
The exact calculation of all-terminal network reliability is an NP-hard problem, precluding its use in the design of optimal network topologies for problems of realistic size. This paper presents an improved upper bound for allterminal network reliability that is significantly more general than previously published bounds as it allows arcs of different reliabilities. The bound is calculated in ...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملAn improved upper bound on the queuenumber of the hypercube
Recently, Hasunuma and Hirota [1] addressed themselves to study the queue layout problem on hypercubes. The n-dimensional hypercube Qn is a graph with 2n vertices in which each vertex corresponds to an n-tuple (b1,b2, . . . ,bn) on the set {0,1}n and two vertices are linked by an edge if and only if they differ in exactly one coordinate [3]. A k-queue layout of a graph G consists of a linear or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.12.025