1067 search results - page 22 / 214 » Probabilistic regular graphs |
111
Voted
COMBINATORICS
2006
15 years 14 days ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
104
Voted
CAV
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
105
click to vote
CVIU
2007
15 years 12 days ago
2007
Nowadays color image processing is an essential issue in computer vision. Variational formulations provide a framework for color image restoration, smoothing and segmentation prob...
134
click to vote
ALGORITHMICA
2002
15 years 9 days ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
CORR
2008
Springer
15 years 15 days ago
2008
Springer
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn),...