Sciweavers

14054 search results - page 209 / 2811
» P
Sort
View
PCI
2005
Springer
15 years 10 months ago
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...
Stavros D. Nikolopoulos, Leonidas Palios
ECAI
2000
Springer
15 years 9 months ago
Local Search on Random 2+p-SAT
Josh Singer, Ian P. Gent, Alan Smaill
FUIN
2002
90views more  FUIN 2002»
15 years 4 months ago
A Direct Construction of a Universal P System
We present a direct universal P system based on splicing. Our approach differs from those shown in previous papers as the P system we construct takes as input an encoding of anothe...
Pierluigi Frisco, Hendrik Jan Hoogeboom, Paul Sant
NAR
1998
104views more  NAR 1998»
15 years 4 months ago
The ribonuclease P database
Ribonuclease P is the endoribonuclease responsible for the removal of leader sequences from tRNA precursors. Ribonuclease P is a ribonucleoprotein, and in bacteria the RNA alone i...
James W. Brown
ISAAC
2009
Springer
131views Algorithms» more  ISAAC 2009»
15 years 11 months ago
A Certifying Algorithm for 3-Colorability of P5-Free Graphs
We provide a certifying algorithm for the problem of deciding whether a P5-free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colo...
Daniel Bruce, Chính T. Hoàng, Joe Sa...