253 search results - page 40 / 51 » Perfection thickness of graphs |
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
ISAAC
2005
Springer
14 years 27 days ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
ASPLOS
2004
ACM
14 years 25 days ago
2004
ACM
Pipeline flushes are becoming increasingly expensive in modern microprocessors with large instruction windows and deep pipelines. Selective re-execution is a technique that can r...
PLDI
1994
ACM
13 years 11 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...