Results 101 to 110 of about 155 (146)
We study formal path expressions for two edge-labeled two-terminal directed acyclic graph families: directed triangulated grid graphs (TGGs) and directed king graphs.
Vadim E. Levit, Mark Korenblit
core +1 more source
Edge Colouring Reduced Indifference Graphs
, 1999 The chromatic index problem -- finding the minimum number of colours required for colouring the edges of a graph -- is still unsolved for indifference graphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal ...
Celina M. H. De Figueiredo +3 more
core
A simple algorithm for constructing Szemerédi's Regularity Partition
, 1999 We give a simple constructive version of Szemer'edi's Regularity Lemma, based on the computation of singular values of matrices. Mathematical Reviews Subject Numbers: 05C85, 68R10.
Alan Frieze, Ravi Kannan
core
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
Finite-dimensional flexible algebras associated with directed and weighted CW complexes
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria MatematicaIn this paper, we study a link between directed and weighted CW complexes (also called configurations) and flexible algebras determining which configurations are associated with those algebras.
Ceballos Manuel
doaj +1 more source
New Bounds for Codes Identifying Vertices in Graphs
, 1999 Let G = (V; E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v 2 V , the neighbouring set N(v; C) is the set of vertices of C at distance at most one from v.
Gerard Cohen +3 more
core
On Finding a Smallest Augmentation to Biconnect a Graph
, 1993 . We consider the problem of finding a minimum number of edges whose addition biconnects an undirected graph. This problem has been studied by several other researchers, two of whom presented a linear time algorithm for this problem in an earlier volume ...
Vijaya Ramachandran, Tsan-sheng Hsu
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
RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS. [PDF]
Multiscale Model Simul, 2018 Heroy S +4 more
europepmc +1 more source
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