Results 61 to 70 of about 100 (100)
Dominating Sets Whose Closed Stars Form Spanning Trees
, 1995 For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W .
Jerrold W. Grossman
core
Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
, 1996 This paper develops new techniques for constructing separators for graphs embedded on surfaces of bounded genus. For any arbitrarily small positive " we show that any n-vertex graph G of genus g can be divided in O(n + g) time into components whose ...
L. Aleksandrov, H. Djidjev
core
Optimizing Bull-Free Perfect Graphs
, 1997 . A bull is a graph obtained by adding a pendant vertex at two vertices of a triangle. Here we present polynomial-time combinatorial algorithms for the optimal weighted coloring and weighted clique problems in bull-free perfect graphs. The algorithms are
Celina M. H. De Figueiredo +1 more
core
, 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
On the quality of spectral separators
, 1998 . Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there has not been much prior analysis of the quality of the separators produced by this technique;
Gary, L. Miller, Stephen Guattery
core
Finding All Maximal Cliques of a Family of Induced Subgraphs
, 2008 Many real world problems can be mapped onto graphs and solved with well-established efficient algorithms studied in graph theory. One such problem is the following: given a set of objects and an irreflexive and symmetric relation between these objects ...
Daniel Baum
core
The Page Number Problem for Partially Ordered Sets
, 2013 Umieszczenie grafu w książce jest definiowane przez kolejność jego wierzchołków na grzbiecie książki i przyporządkowanie jego krawędzi stronom książki tak, aby na żadnej stronie krawędzie nie przecinały się. Umieszczenie zbioru częściowo uporządkowanego (
Kwiatkowska, Anna Beata
core
RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS. [PDF]
Multiscale Model Simul, 2018 Heroy S +4 more
europepmc +1 more source
Harary index of the zero divisor graph of upper triangular matrices. [PDF]
Sci RepAlshanqiti O, Sharma S, Bhat VK.
europepmc +1 more source
A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree. [PDF]
Springerplus, 2016 Nagoor Gani A, Latha SR.
europepmc +1 more source