2125 search results - page 104 / 425 » On Graph Complexity |
145
Voted
IWOCA
2010
Springer
14 years 9 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
112
Voted
COCO
2007
Springer
15 years 9 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
138
Voted
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
109
Voted
WAW
2009
Springer
15 years 9 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
144
Voted
AGTIVE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Since the systematic evolution of graph-like program models has become important in software engineering, graph transformation has gained much attention in this area. For...