Results 71 to 80 of about 155 (146)
On the Number of Directions in Visibility Representations of Graphs (Extended Abstract)
, 1995 We consider visibility representations of graphs in which the vertices are presented by a collection O of non-overlapping convex regions on the plane. Two points x and y are visible if the straight-line segment xy is not obstructed by any object.
Jorge Urrutia +5 more
core +1 more source
Eccentricity of Networks with Structural Constraints
Discussiones Mathematicae Graph Theory, 2020 The eccentricity of a node v in a network is the maximum distance from v to any other node. In social networks, the reciprocal of eccentricity is used as a measure of the importance of a node within a network.
Krnc Matjaž +3 more
doaj +1 more source
Върху някои свойства на булевите функции и техните диаграми за двоично решаване
, 2011 Иво Й. Дамянов - Манипулирането на булеви функции е основнo за теоретичната информатика, в това число логическата оптимизация, валидирането и синтеза на схеми.
Damyanov, Ivo
core
, 1993 We introduce and study online versions of weighted matching problems in metric spaces. We present a simple 2k \Gamma 1 competitive algorithm for online minimum weighted bipartite matching where 2k is the number of nodes. We show that this competitiveness
Kirk Pruhs, Bala Kalyanasundaram
core
Gossiping in circulant graphs [PDF]
, 2014 Investiguem el problema de fer safareig, en el qual els nodes d'una xarxad'intercomunicació comparteixen informació mitjançant un protocol de comunicació per rondes.
Romain Gay; ENS Cachan, Paris
core +1 more source
Stack And Queue Layouts Of Posets
, 1995 . The stacknumber (queuenumber) of a poset is defined as the stacknumber (queuenumber) of its Hasse diagram viewed as a directed acyclic graph. Upper bounds on the queuenumber of a poset are derived in terms of its jumpnumber, its length, its width, and ...
Lenwood S. Heath +2 more
core
Optimal Total Exchange in Cayley Graphs
, 1996 Consider an interconnection network and the following situation: every node needs to send a different message to every other node. This is the total exchange problem, one of a number of information dissemination problems known as collective ...
Nikitas J. Dimopoulos +1 more
core
Edge Disjoint Paths in Moderately Connected Graphs
, 2006 . We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as possible us-ing paths that are mutually edge disjoint.
Satish Rao, Shuheng Zhou
core +1 more source
, 1995 . Berman and Schnitger gave a randomized reduction from approximating MAX-SNP problems within constant factors arbitrarily close to 1 to approximating clique within a factor of n ffl (for some ffl). This reduction was further studied by Blum, who gave
Avi Wigderson +3 more
core
Caterpillars Have Antimagic Orientations
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018 An antimagic labeling of a directed graph D with m arcs is a bijection from the set of arcs of D to {1, …, m} such that all oriented vertex sums of vertices in D are pairwise distinct, where the oriented vertex sum of a vertex u is the sum of labels of ...
Lozano Antoni
doaj +1 more source