Results 1  10
of
289,694
Minormonotone crossing number
, 2005
"... The minor crossing number of a graph G, mcr(G), is defined as the minimum crossing number of all graphs that contain G as a minor. We present some basic properties of this new minormonotone graph invariant. We give ..."
Abstract
 Add to MetaCart
The minor crossing number of a graph G, mcr(G), is defined as the minimum crossing number of all graphs that contain G as a minor. We present some basic properties of this new minormonotone graph invariant. We give
Interval Routing and MinorMonotone Graph Parameters
, 2006
"... We survey a number of minormonotone graph parameters and their relationship to the complexity of routing on graphs. In particular we compare the interval routing parameters # slir (G) and # sir (G) with Colin de Verdiere's graph invariant (G) and its variants #(G) and #(G). We show that for ..."
Abstract
 Add to MetaCart
We survey a number of minormonotone graph parameters and their relationship to the complexity of routing on graphs. In particular we compare the interval routing parameters # slir (G) and # sir (G) with Colin de Verdiere's graph invariant (G) and its variants #(G) and #(G). We show
On the Relation Between Two MinorMonotone Graph Parameters
, 1997
"... We prove that for each graph (G) (G) + 2, where and are minormonotone graph invariants introduced by Colin de Verdi'ere [3] and van der Holst, Laurent and Schrijver [5]. It is also shown that a graph G exists with (G) ! (G). The graphs G with maximal planar complement and (G) = jV (G)j ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We prove that for each graph (G) (G) + 2, where and are minormonotone graph invariants introduced by Colin de Verdi'ere [3] and van der Holst, Laurent and Schrijver [5]. It is also shown that a graph G exists with (G) ! (G). The graphs G with maximal planar complement and (G) = jV (G
The genus crossing number
, 2007
"... Pach and Tóth [6] introduced a new version of the crossing number parameter, called the degenerate crossing number, by considering proper drawings of a graph in the plane and counting multiple crossing of edges through the same point as a single crossing when all pairwise crossings of edges at that ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
at that point are transversal. We propose a related parameter, called the genus crossing number, where edges in the drawing need not be represented by simple arcs. This relaxation has two important advantages. First, the genus crossing number is invariant under taking subdivisions of edges and is also a minormonotone
Distortion invariant object recognition in the dynamic link architecture
 IEEE TRANSACTIONS ON COMPUTERS
, 1993
"... We present an object recognition system based on the Dynamic Link Architecture, which is an extension to classical Artificial Neural Networks. The Dynamic Link Architecture exploits correlations in the finescale temporal structure of cellular signals in order to group neurons dynamically into hig ..."
Abstract

Cited by 636 (81 self)
 Add to MetaCart
are represented by sparse graphs, whose vertices are labeled by a multiresolution description in terms of a local power spectrum, and whose edges are labeled by geometrical distance vectors. Object recognition can be formulated as elastic graph matching, which is performed here by stochastic optimization of a
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
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
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
Interprocedural Slicing Using Dependence Graphs
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1990
"... ... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previou ..."
Abstract

Cited by 822 (85 self)
 Add to MetaCart
... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends
Results 1  10
of
289,694