Results 1  10
of
254,915
Wiring EdgeDisjoint Layouts
, 1996
"... We consider the wiring or layer assignment problem for edgedisjoint layouts. The wiring problem is well understood for the case that the underlying layout graph is a square grid (see [8]). In this paper, we introduce a more general approach to this problem. For an edgedisjoint layout in the plane ..."
Abstract
 Add to MetaCart
We consider the wiring or layer assignment problem for edgedisjoint layouts. The wiring problem is well understood for the case that the underlying layout graph is a square grid (see [8]). In this paper, we introduce a more general approach to this problem. For an edgedisjoint layout in the plane
Parallel algorithms for the edgecoloring and edgecoloring update problems
 J. Parallel Distributed Comput
, 1996
"... Let G(V, E) be a simple undirected graph with a maximum vertex degree �(G) (or � for short), �V � � n and �E � � m. An edgecoloring of G is an assignment to each edge in G a color such that all edges sharing a common vertex have different colors. The minimum number of colors needed is denoted by ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
parallel algorithm for this problem runs in O( � 3/2 log 3 �� �log n) time using O(max�n�, � 3 �) processors. The second problem is to color the edges of a given uncolored graph G with ��1 colors. For this problem, our first parallel algorithm requires O( � 5.5 log 3 � log n � � 5 log 4 n) time and O
EDGEDISJOINT HAMILTON CYCLES IN GRAPHS
, 2009
"... In this paper we give an approximate answer to a question of NashWilliams from 1970: we show that for every α> 0, every sufficiently large graph on n vertices with minimum degree at least (1/2 + α)n contains at least n/8 edgedisjoint Hamilton cycles. More generally, we give an asymptotically b ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
In this paper we give an approximate answer to a question of NashWilliams from 1970: we show that for every α> 0, every sufficiently large graph on n vertices with minimum degree at least (1/2 + α)n contains at least n/8 edgedisjoint Hamilton cycles. More generally, we give an asymptotically
Existence and Construction of EdgeDisjoint Paths on Expander Graphs
"... Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V, we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the set of q paths so found is edgedisjoint. (For general graphs the related decision problem is NPcomplete.) We prove suffic ..."
Abstract
 Add to MetaCart
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V, we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the set of q paths so found is edgedisjoint. (For general graphs the related decision problem is NPcomplete.) We prove
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
computational rule, the sumproduct algorithm operates in factor graphs to computeeither exactly or approximatelyvarious marginal functions by distributed messagepassing in the graph. A wide variety of algorithms developed in artificial intelligence, signal processing, and digital communications can
EDGE–DISJOINT PATHS IN PERMUTATION GRAPHS
"... In this paper we consider the following problem. Given an undirected graph G = (V,E) and vertices s1, t1; s2, t2, the problem is to determine whether or not G admits two edge–disjoint paths P1 and P2 connecting s1 with t1 and s2 with t2, respectively. We give a linear (O(V + E)) algorithm to s ..."
Abstract
 Add to MetaCart
In this paper we consider the following problem. Given an undirected graph G = (V,E) and vertices s1, t1; s2, t2, the problem is to determine whether or not G admits two edge–disjoint paths P1 and P2 connecting s1 with t1 and s2 with t2, respectively. We give a linear (O(V + E)) algorithm
Approximation algorithms for edgedisjoint paths and unsplittable flow
 Efficient Approximation and Online Algorithms
, 2006
"... Abstract. In the maximum edgedisjoint paths problem (MEDP) the input consists of a graph and a set of requests (pairs of vertices), and the goal is to connect as many requests as possible along edgedisjoint paths. We give a survey of known results about the complexity and approximability of MEDP ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. In the maximum edgedisjoint paths problem (MEDP) the input consists of a graph and a set of requests (pairs of vertices), and the goal is to connect as many requests as possible along edgedisjoint paths. We give a survey of known results about the complexity and approximability of MEDP
EdgeColoring SeriesParallel Multigraphs
, 2000
"... We give a simpler proof of Seymour's Theorem on edgecoloring seriesparallel multigraphs and derive a lineartime algorithm to check whether a given seriesparallel multigraph can be colored with a given number of colors. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We give a simpler proof of Seymour's Theorem on edgecoloring seriesparallel multigraphs and derive a lineartime algorithm to check whether a given seriesparallel multigraph can be colored with a given number of colors.
Edgedisjoint Odd Cycles in 4edgeconnected Graphs
"... Finding edgedisjoint odd cycles is one of the most important problems in graph theory, graph algorithm and combinatorial optimization. In fact, it is closely related to the wellknown maxcut problem. One of the difficulties of this problem is that the ErdősPósa property does not hold for odd cycl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Finding edgedisjoint odd cycles is one of the most important problems in graph theory, graph algorithm and combinatorial optimization. In fact, it is closely related to the wellknown maxcut problem. One of the difficulties of this problem is that the ErdősPósa property does not hold for odd
On List EdgeColorings of Subcubic Graphs
 DISCRETE MATH
"... In this paper we study list edgecolorings of graphs with small maximal degree. In particular, we show that simple subcubic graphs are "10/3edgechoosable". The precise meaning of this statement is that no matter how we prescribe arbitrary lists of three colors on edges of a subgraph H of ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
In this paper we study list edgecolorings of graphs with small maximal degree. In particular, we show that simple subcubic graphs are "10/3edgechoosable". The precise meaning of this statement is that no matter how we prescribe arbitrary lists of three colors on edges of a subgraph H
Results 1  10
of
254,915