681 search results - page 54 / 137 » General Polynomial Time Decomposition Algorithms |
88
Voted
IANDC
2008
15 years 16 days ago
2008
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...
SODA
1996
ACM
15 years 1 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
101
click to vote
ESA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
124
click to vote
ALGORITHMICA
1998
15 years 6 days ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
82
Voted
WADS
1995
Springer
15 years 4 months ago
1995
Springer
We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propaga...