384 search results - page 61 / 77 » On s-hamiltonian-connected line graphs |
TVCG
2010
13 years 7 months ago
2010
—Tag clouds have proliferated over the web over the last decade. They provide a visual summary of a collection of texts by visually depicting the tag frequency by font size. In u...
VIROLOGY
2010
13 years 7 months ago
2010
By looking on how computer security issues are handled today, dealing with numerous and unknown events is not easy. Events need to be normalized, abnormal behaviors must be describ...
CONEXT
2010
ACM
13 years 6 months ago
2010
ACM
Client-server networks are pervasive, fundamental, and include such key networks as the Internet, power grids, and road networks. In a client-server network, clients obtain a serv...
SIGSOFT
1994
ACM
14 years 20 days ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
APPML
2007
13 years 8 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...