Results 1  10
of
228,290
Edgecoloring in bipartite graphs
, 1997
"... Given a bipartite graph G with n nodes, m edges and maximum degree \Delta, we find an edge coloring for G using \Delta colors in time T + O(m log \Delta), where T is the time needed to find a perfect matching in a kregular bipartite graph with at most O(m) edges and k ^ \Delta. Together with best k ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Given a bipartite graph G with n nodes, m edges and maximum degree \Delta, we find an edge coloring for G using \Delta colors in time T + O(m log \Delta), where T is the time needed to find a perfect matching in a kregular bipartite graph with at most O(m) edges and k ^ \Delta. Together with best
AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS
, 1973
"... The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/. ..."
Abstract

Cited by 712 (1 self)
 Add to MetaCart
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple
Books in graphs
, 2008
"... A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α) ..."
Abstract

Cited by 2380 (22 self)
 Add to MetaCart
A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3499 (47 self)
 Add to MetaCart
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions
Heterochromatic Matchings in EdgeColored Bipartite Graphs
, 2006
"... Abstract. Let G = (V,E) be an edgecolored graph, i.e., G is assigned a surjective function C: E → {1,2, · · ·,r}, the set of colors. A matching of G is called heterochromatic if its any two edges have different colors. Let (B,C) be an edgecolored bipartite graph and dc (v) be color degree of a ..."
Abstract
 Add to MetaCart
Abstract. Let G = (V,E) be an edgecolored graph, i.e., G is assigned a surjective function C: E → {1,2, · · ·,r}, the set of colors. A matching of G is called heterochromatic if its any two edges have different colors. Let (B,C) be an edgecolored bipartite graph and dc (v) be color degree of a
The heterochromatic matchings in edgecolored bipartite graphs
"... Let (G, C) be an edgecolored bipartite graph with bipartition (X, Y). A heterochromatic matching of G is such a matching in which no two edges have the same color. Let N c (S) denote a maximum color neighborhood of S ⊆ V (G). We show that if N c (S)  ≥ S  for all S ⊆ X, then G has a heterochro ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Let (G, C) be an edgecolored bipartite graph with bipartition (X, Y). A heterochromatic matching of G is such a matching in which no two edges have the same color. Let N c (S) denote a maximum color neighborhood of S ⊆ V (G). We show that if N c (S)  ≥ S  for all S ⊆ X, then G has a
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized
Results 1  10
of
228,290