760 search results - page 18 / 152 » Algorithms for finding clique-transversals of graphs |
ESA
2004
Springer
14 years 2 months ago
2004
Springer
The computation of dominators in a flowgraph has applications in several areas, including program optimization, circuit testing, and theoretical biology. Lengauer and Tarjan [30]...
ICPR
2002
IEEE
14 years 9 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...
SIAMDM
2010
13 years 3 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...
CATS
1998
13 years 10 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...