Results 151 to 160 of about 121,460 (194)
Some of the next articles are maybe not open access.
Packing cuts in undirected graphs
Networks, 2004AbstractWe address the problem of finding the largest collection of edge‐disjoint cuts in an undirected graph, dubbed CUT PACKING, focusing on its complexity, about which very little is known. We show a very close relationship with INDEPENDENT SET, namely, for the same graph G, the size of the largest cut packing of G is at least the independence ...
CAPRARA, ALBERTO, A. Panconesi, R. Rizzi
openaire +3 more sources
Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), 2002
A fundamental problem in designing massively parallel computer systems and fast communication networks is the maximization of the number of nodes given a diameter and degree of a network. This maximal number is bounded above by the Moore bound. For undirected circulant graphs, an upper bound is also given but no exact formula has been found yet for ...
openaire +1 more source
A fundamental problem in designing massively parallel computer systems and fast communication networks is the maximization of the number of nodes given a diameter and degree of a network. This maximal number is bounded above by the Moore bound. For undirected circulant graphs, an upper bound is also given but no exact formula has been found yet for ...
openaire +1 more source
1995
When we consider graphical models for the multivariate complex normal distribution we formulate the models in terms of simple undirected graphs. This chapter presents the concept of simple undirected graphs. As the main purpose is to define and introduce the later needed results, the presentation is at times short and compact.
H. H. Andersen +3 more
openaire +1 more source
When we consider graphical models for the multivariate complex normal distribution we formulate the models in terms of simple undirected graphs. This chapter presents the concept of simple undirected graphs. As the main purpose is to define and introduce the later needed results, the presentation is at times short and compact.
H. H. Andersen +3 more
openaire +1 more source
Solving Undirected Graph Problems on VLSI
SIAM Journal on Computing, 1985We study VLSI solutions to the connected component problem on networks that have area too small to store all the edges of the graph for the entire computation. We give lower bounds on the time needed to solve this problem on such networks, as well as an optimal algorithm.
Hambrusch, Susanne E., Simon, Janos
openaire +1 more source
Particle Systems Acting on Undirected Graphs
Journal of Statistical Physics, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bandt, C., Hadeler, K. P., Kriese, F.
openaire +1 more source
Directed and Undirected Graphs
2016Up to now, we have been able to construct all basic number domains ℕ, ℤ, ℚ, ℝ, ℂ. But we have not considered geometric objects. This chapter begins to fill that gap. It introduces the most elementary geometric objects: graphs—systems of points and arrows connected by directed or undirected lines.
Guerino Mazzola, Maria Mannone, Yan Pang
openaire +1 more source
Vertex cutsets of undirected graphs
IEEE Transactions on Reliability, 1995This paper deals with the enumeration of all minimal s-t vertex cutsets separating two vertices (source and terminal) in an undirected graph. The problem is handled by direct-enumeration based on a necessary and sufficient condition for a set of vertices to be a minimal vertex cutset.
C. Patvardhan, V.C. Prasad, V.P. Pyara
openaire +1 more source
A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
Discrete Mathematics, Algorithms and Applications, 2012Circulant graphs have been extensively investigated over the past 30 years because of their broad application to different fields of theory and practice. Two known surveys on circulant networks including a survey on undirected circulants have been published: by Bermond et al. [Distributed loop computer networks: A survey, J.
openaire +2 more sources
Applications of numbered undirected graphs
Proceedings of the IEEE, 1977Numbered undirected graphs are becoming an increasingly useful family of mathematical models for a broad range of applications. They have found usage in various coding theory problems, including the design of good radar-type codes, synch-set codes and convolutional codes with optimal autocorrelation properties.
G.S. Bloom, S.W. Golomb
openaire +1 more source
Undirected Graphs Realizable as Graphs of Modular Lattices
Canadian Journal of Mathematics, 1965If (L, ≥) is a lattice or partial order we may think of its Hesse diagram as a directed graph, G, containing the single edge E(c, d) if and only if c covers d in (L, ≥). This graph we shall call the graph of (L, ≥). Strictly speaking it is the basis graph of (L, ≥) with the loops at each vertex removed; see (3, p.
openaire +1 more source