83 search results - page 7 / 17 » dam 2006 |
DAM
2006
13 years 8 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
DAM
2006
13 years 8 months ago
2006
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
DAM
2006
13 years 8 months ago
2006
We prove that a triangle-free graph G is a tolerance graph if and only if there exists a set of consecutively ordered stars that partition the edges of G. Since tolerance graphs a...
DAM
2006
13 years 8 months ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
DAM
2006
13 years 8 months ago
2006
Sequential dynamical systems have the property, that the updates of states of individual cells occur sequentially, so that the global update of the system depends on the order of t...