97 search results - page 13 / 20 » Graphs of arbitrary excessive class |
PLDI
1994
ACM
15 years 1 months ago
1994
ACM
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
AMAI
2005
Springer
14 years 9 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
USENIX
2007
14 years 12 months ago
2007
Monitoring and mining real-time network data streams is crucial for managing and operating data networks. The information that network operators desire to extract from the network...
128
click to vote
SIAMCOMP
2010
14 years 8 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
PADS
2005
ACM
15 years 3 months ago
2005
ACM
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...