3204 search results - page 397 / 641 » The Alcuin Number of a Graph |
209
click to vote
IDEAS
2000
IEEE
15 years 11 months ago
2000
IEEE
I n this paper, we address the problem of query processing o n distributed semi-structured data. The distributed semistructured data can be modeled as a rooted and edge-labeled gr...
194
click to vote
COCOON
2000
Springer
15 years 11 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
201
Voted
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...
164
click to vote
CI
1998
15 years 6 months ago
1998
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....
150
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
![A [k, k+1]-Factor Containing A Given Hamiltonian Cycle](http://sciweavers.com/files/imagecache/thumbnail/imagecache/a_k_k_1_factor_containing_a_given_hamiltonian_cycle_COMBINATORICS_1999.jpg "A [k, k+1]-Factor Containing A Given Hamiltonian Cycle")
We prove the following best possible result. Let k 2 be an integer and G be a graph of order n with minimum degree at least k. Assume n 8k - 16 for even n and n 6k-13 for odd n...