3471 search results - page 388 / 695 » Obstacle Numbers of Graphs |
146
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
182
click to vote
IPCO
2010
15 years 8 months ago
2010
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
121
click to vote
DAM
2006
15 years 6 months ago
2006
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
184
click to vote
EOR
2006
15 years 6 months ago
2006
: All information systems have to be protected. As the number of information objects and the number of users increase the task of information system's protection becomes more ...
166
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...