Sciweavers

400 search results - page 20 / 80
» On some Properties of DNA Graphs
Sort
View
IWPEC
2004
Springer
14 years 1 months ago
Parameterized Graph Separation Problems
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
Dániel Marx
CIC
2004
107views Communications» more  CIC 2004»
13 years 9 months ago
Hexagonal and Pruned Torus Networks as Cayley Graphs
Hexagonal mesh and torus, as well as honeycomb and certain other pruned torus networks, are known to belong to the class of Cayley graphs which are node-symmetric and possess othe...
Wenjun Xiao, Behrooz Parhami
CORR
2010
Springer
60views Education» more  CORR 2010»
13 years 8 months ago
Hitting time results for Maker-Breaker games
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael...
ACL
1998
13 years 9 months ago
Time Mapping with Hypergraphs
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
Jan W. Amtrup, Volker Weber
ADBIS
2009
Springer
148views Database» more  ADBIS 2009»
14 years 2 months ago
On Containment of Conjunctive Queries with Negation
Abstract. We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the ...
Victor Felea