1461 search results - page 117 / 293 » Complexity of Graph Covering Problems |
IJLIT
2010
14 years 8 months ago
2010
Whereas abandonment of detailed regulation is widely asserted to be the true way along with the fluctuations of the business models and emergence of IP-based services, there are s...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
105
click to vote
SPRINGSIM
2010
14 years 8 months ago
2010
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
117
click to vote
BMCBI
2005
14 years 10 months ago
2005
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
JUCS
2007
14 years 10 months ago
2007
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...