523 search results - page 38 / 105 » Decidability of string graphs |
153
click to vote
OSDI
2006
ACM
16 years 3 months ago
2006
ACM
Software attacks often subvert the intended data-flow in a vulnerable program. For example, attackers exploit buffer overflows and format string vulnerabilities to write data to u...
130
Voted
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we give linear time algorithms to decide core stability, core largeness, exactness, and extendability of flow games on uniform networks (all edge capacities are 1)....
147
click to vote
SWAT
2010
Springer
15 years 8 months ago
2010
Springer
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
140
click to vote
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
114
Voted
AAECC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The paper deals with the question of recognizing the mutual positions of the connected components of a non-singular real projective surface S in the real projective 3-spa...