Sciweavers

COCOON
2003
Springer
13 years 9 months ago
Petri Nets with Simple Circuits
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
Hsu-Chun Yen, Lien-Po Yu
COCOON
2003
Springer
13 years 9 months ago
Fault-Hamiltonicity of Product Graph of Path and Cycle
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...
Jung-Heum Park, Hee-Chul Kim
COCOON
2003
Springer
13 years 9 months ago
On Constrained Minimum Pseudotriangulations
In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the siz...
Günter Rote, Cao An Wang, Lusheng Wang, Yin-F...
COCOON
2003
Springer
13 years 9 months ago
Genomic Distances under Deletions and Insertions
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome ev...
Mark Marron, Krister M. Swenson, Bernard M. E. Mor...
COCOON
2003
Springer
13 years 9 months ago
Matroid Representation of Clique Complexes
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
COCOON
2003
Springer
13 years 9 months ago
Perturbation of the Hyper-Linked Environment
Hyun Chul Lee, Allan Borodin
COCOON
2003
Springer
13 years 9 months ago
The Complexity of Boolean Matrix Root Computation
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
Martin Kutz
COCOON
2003
Springer
13 years 9 months ago
On Spectral Graph Drawing
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an abili...
Yehuda Koren
COCOON
2003
Springer
13 years 9 months ago
Randomized Approximation of the Stable Marriage Problem
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...
Magnús M. Halldórsson, Kazuo Iwama, ...
COCOON
2003
Springer
13 years 9 months ago
Tetris is Hard, Even to Approximate
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configurat...
Erik D. Demaine, Susan Hohenberger, David Liben-No...