3008 search results - page 371 / 602 » Independence in connected graphs |
179
click to vote
MFCS
2004
Springer
16 years 6 days ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
148
click to vote
FOCS
2003
IEEE
16 years 4 days ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
198
click to vote
ICCAD
2003
IEEE
16 years 4 days ago
2003
IEEE
: This paper presents FROSTY, a computer program for automatically extracting the hierarchy of a large-scale digital CMOS circuit from its transistor-level netlist description and ...
206
click to vote
NOMS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
175
click to vote
ICAIL
2009
ACM
15 years 11 months ago
2009
ACM
We propose an analysis of the codified Law of France as a structured system. Fifty two legal codes are selected on the basis of explicit legal criteria and considered as vertices ...