1729 search results - page 143 / 346 » Bound Graph Polysemy |
169
click to vote
SIGMETRICS
2003
ACM
15 years 11 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
203
click to vote
PAAPP
2000
15 years 6 months ago
2000
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
146
click to vote
IWPEC
2009
Springer
16 years 28 days ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
141
click to vote
ENDM
2007
15 years 6 months ago
2007
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
183
click to vote
EJC
2007
15 years 6 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...