4865 search results - page 268 / 973 » The Complexity of Graph Connectivity |
154
click to vote
COCOON
2005
Springer
16 years 5 days ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
199
click to vote
DAC
1999
ACM
15 years 11 months ago
1999
ACM
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
170
Voted
EMNLP
2008
15 years 8 months ago
2008
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
168
click to vote
AIPS
2009
15 years 7 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
161
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...