Rui Wang, Francis.C.M. Lau  Home/Search
Context
Related
| csis.hku.hk/research/t...TR200309.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: csis.hku.hk/research/techreps/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that a cubic graph G with girth g(G) 5 has a Hamiltonian Circuit if and only if the matrix A+ I can be row permuted such that each column has at most 2 blocks of consecutive 1's, where A is the adjacency matrix of G, I is the unit matrix, and a block can be consecutive in circular sense, i.e., the first row and the last row are viewed as adjacent rows. Then, based on this necessary and su#cient condition and the NP-completeness of Hamiltonian Circuit for cubic graphs [2], we prove... (Update)
Active bibliography (related documents): More All
1.6: Consecutive ones Block for Symmetric Matrices Rui Wang.. - Department Of Computer (2003) (Correct)
0.2: Multi-Dimensional Interval Routing Schemes - Flammini, Gambosi, Nanni, Tan (1995) (Correct)
0.1: On Physical Mapping and the Consecutive Ones Property for.. - Atkins, Middendorf (1996) (Correct)
Similar documents based on text: More All
0.3: Optimal Gossiping in Paths and Cycles - Lau, Zhang (1997) (Correct)
0.1: JESSICA: Java-Enabled Single-System-Image Computing Architecture - Ma, Wang, Lau (1999) (Correct)
0.1: The Generalized Dimension Exchange Method for Load Balancing in.. - Xu, Lau (1995) (Correct)
BibTeX entry: (Update)
@misc{ wang-consecutive,
author = "Rui Wang and Francis.C.M. Lau",
title = "Consecutive ones Block for Symmetric Matrices",
url = "citeseer.ist.psu.edu/wang03consecutive.html" }
Citations (may not include all citations):686 A guide to the theory of NPCompleteness (context) - Garey, Jonson et al. - 1979
42 Algorithms and complexity (context) - Papadimitriou, Steiglitz et al. - 1998
30 Four strikes against physical mapping of DNA - Goldberg, Glumbic et al. - 1995
14 Springer-Verlag (context) - Reinhard, Theory et al. - 1997
9 Linear algorithm to recognize interval graphs and test for c.. (context) - Booth, Lueker - 1975
8 Polynomial complete consecutive information retrieval proble.. (context) - Kou - 1977
4 on Theoretical Aspects of Computer Science (context) - Flammini, Gambosi et al. - 1995
2 The planar Hamiltonian circuit is NP-Complete (context) - Garey, Jonson et al. - 1976
2 NP-Complete Results for All-Shortest Paths Interval Routing (context) - Wang, Lau et al. - 2002
Documents on the same site (http://www.csis.hku.hk/research/techreps/): More
DROLAP - A Dense-Region Based Approach to On-line.. - Cheung, Zhou, Kao, Hu, .. (1999) (Correct)
A Distance-Vector Routing Protocol for Networks with.. - Huang, Chen, Lau, Xie (2000) (Correct)
A Study on Musical Features for Melody Databases - Lap, Kao (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC