3268 search results - page 353 / 654 » The hub number of a graph |
142
click to vote
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
200
click to vote
BPM
2006
Springer
15 years 10 months ago
2006
Springer
Complexity has undesirable effects on, among others, the correctness, maintainability, and understandability of business process models. Yet, measuring complexity of business proce...
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...
181
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...