684 search results - page 89 / 137 » On embedding well-separable graphs |
162
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
127
click to vote
DAC
2009
ACM
15 years 10 months ago
2009
ACM
For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verifica...
112
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...
168
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
Schedulability analysis of real-time embedded systems requires worst case timing guarantees of embedded software performance. This involves not only language level program analysi...
130
click to vote
ECRTS
2008
IEEE
15 years 10 months ago
2008
IEEE
There is a need for using virtual memory in real-time applications: using virtual addressing provides isolation between concurrent processes; in addition, paging allows the execut...