895 search results - page 6 / 179 » Using graphs for some discrete tomography problems |
DGCI
2000
Springer
13 years 11 months ago
2000
Springer
A generalization of a classical discrete tomography problem is considered: Reconstruct binary matrices from their absorbed row and columns sums, i.e., when some known absorption is...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
GD
2004
Springer
14 years 22 days ago
2004
Springer
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...