Results 61 to 70 of about 137 (126)
Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs
, 1998 We show that computing (and even approximating) MAXIMUM CLIQUE and MINIMUM GRAPH COLORING for circulant graphs is essentially as hard as in the general case.
Ivan Gerace +5 more
core +1 more source
Fast algorithms for determining (generalized) core groups in social networks
Core, Large network, Decomposition, Graph algorithm, 05A18, 05C70, 05C85, 05C90, 68R10, 68W40, 92H30, 92G30, 93A15,
Vladimir Batagelj, Matjaž Zaveršnik
core +1 more source
The agreement distance of rooted phylogenetic networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The minimal number of rooted subtree prune and regraft (rSPR) operations needed to transform one phylogenetic tree into another one induces a metric on phylogenetic trees - the rSPR-distance.
Jonathan Klawitter
doaj +1 more source
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.
Gay, Romain
core +2 more sources
On the number of pancake stacks requiring four flips to be sorted [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Using existing classification results for the 7- and 8-cycles in the pancake graph, we determine the number of permutations that require 4 pancake flips (prefix reversals) to be sorted.
Saúl A. Blanco +2 more
doaj +1 more source
Shrub-depth: Capturing Height of Dense Graphs [PDF]
Logical Methods in Computer Science, 2019 The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question: is there an analogously useful "depth" notion also for dense graphs (say; one which is stable ...
Robert Ganian +4 more
doaj +1 more source
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
Complex of abstract cubes and median problem [PDF]
Computer Science Journal of Moldova, 2011 In this paper a special complex $\mathcal{K}^{n}$ of abstract cubes [2, 3], which contains only $n$-dimensional cubes is examined. The border of this complex is an abstract $(n-1)$-dimensional sphere.
Sergiu Cataranciuc, Petru Soltan
doaj
Върху някои свойства на булевите функции и техните диаграми за двоично решаване
, 2011 Иво Й. Дамянов - Манипулирането на булеви функции е основнo за теоретичната информатика, в това число логическата оптимизация, валидирането и синтеза на схеми.
Damyanov, Ivo
core
Optimizing compatible sets in wireless networks through integer programming
EURO Journal on Computational Optimization, 2014 In wireless networks, the notion of compatible set refers to a set of radio links that can be simultaneously active with a tolerable interference. Finding a compatible set with maximum weighted revenue from the parallel transmissions is an important ...
Yuan Li +3 more
doaj +1 more source