Sciweavers

6740 search results - page 39 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
SCAM
2008
IEEE
14 years 2 months ago
User-Input Dependence Analysis via Graph Reachability
Bug-checking tools have been used with some success in recent years to find bugs in software. For finding bugs that can cause security vulnerabilities, bug checking tools requir...
Bernhard Scholz, Chenyi Zhang, Cristina Cifuentes
ICALP
2007
Springer
14 years 1 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier
ECCC
2010
124views more  ECCC 2010»
13 years 2 months ago
A counterexample to the Alon-Saks-Seymour conjecture and related problems
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
Hao Huang, Benny Sudakov
EUROMICRO
2002
IEEE
14 years 18 days ago
Developing, Validating and Evolving an Approach to Product Line Benefit and Risk Assessment
1 Product line engineering is usually a very beneficial, but sometimes also a very risky endeavor, as there is no guarantee for economic success. In this paper, we will describe an...
Klaus Schmid, Isabel John
CTRSA
2009
Springer
112views Cryptology» more  CTRSA 2009»
13 years 11 months ago
Divisible On-Line/Off-Line Signatures
On-line/Off-line signatures are used in a particular scenario where the signer must respond quickly once the message to be signed is presented. The idea is to split the signing pro...
Chong-zhi Gao, Baodian Wei, Dongqing Xie, Chunming...