3268 search results - page 389 / 654 » The hub number of a graph |
170
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
192
click to vote
IS
2007
15 years 6 months ago
2007
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
163
click to vote
ARSCOM
1998
15 years 6 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
164
click to vote
CGF
1999
15 years 6 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
185
click to vote
NETWORKS
2002
15 years 6 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...