Sciweavers

36 search results - page 3 / 8
» On cycles through specified vertices
Sort
View
WG
2009
Springer
15 years 4 months ago
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Dan...
73
Voted
FECS
2006
107views Education» more  FECS 2006»
14 years 11 months ago
Software Quality Through Requirement and Design
- One of the major areas of software engineering, as specified in the SWEBOK (SoftWare Engineering Body Of Knowledge) [1], is software quality. This paper presents an argument on w...
Massood Towhidnejad
TWC
2008
209views more  TWC 2008»
14 years 9 months ago
Application of Nonbinary LDPC Cycle Codes to MIMO Channels
In this paper, we investigate the application of nonbinary low-density parity-check (LDPC) cycle codes over Galois field GF(q) to multiple-input multiple-output (MIMO) channels. Tw...
Ronghui Peng, Rong-Rong Chen
TOH
2008
78views more  TOH 2008»
14 years 9 months ago
Manual Detection of Spatial and Temporal Torque Variation through a Rotary Switch
We report three experiments on manual detection of torque variations experienced through a rotary switch. The experiments were designed to investigate whether torque perception was...
Hong Z. Tan, Shuo Yang, Zygmunt Pizlo, Pietro Butt...
ICDCS
1996
IEEE
15 years 1 months ago
Larchant: Persistence by Reachability in Distributed Shared Memory Through Garbage Collection
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This ...
Paulo Ferreira, Marc Shapiro