Sciweavers

5473 search results - page 639 / 1095
» On the graph isomorphism problem
Sort
View
JCT
2000
78views more  JCT 2000»
15 years 6 months ago
Discrete Green's Functions
We study discrete Green's functions and their relationship with discrete Laplace equations. Several methods for deriving Green's functions are discussed. Green's fu...
Fan R. K. Chung, S.-T. Yau
NJC
1998
86views more  NJC 1998»
15 years 6 months ago
Parametric Permutation Routing via Matchings
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
Peter Høyer, Kim S. Larsen
DAM
2011
15 years 1 months ago
Hamiltonian index is NP-complete
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is ∗ Research supported by grants No. 1M0545...
Zdenek Ryjácek, Gerhard J. Woeginger, Limin...
DAC
2000
ACM
16 years 7 months ago
Fingerprinting intellectual property using constraint-addition
Recently, intellectual property protection (IPP) techniques attracted a great deal of attention from semiconductor, system integration and software companies. A number of watermar...
Gang Qu, Miodrag Potkonjak
RECOMB
2005
Springer
16 years 7 months ago
Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...