Sciweavers

406 search results - page 31 / 82
» Dominating Sets in Web Graphs
Sort
View
SIAMCOMP
2010
135views more  SIAMCOMP 2010»
13 years 3 months ago
Intractability of Clique-Width Parameterizations
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
AIRWEB
2007
Springer
14 years 3 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
ICCAD
1999
IEEE
96views Hardware» more  ICCAD 1999»
14 years 1 months ago
Implication graph based domino logic synthesis
In this paper, we present a new approach to the problem of inverter elimination in domino logic synthesis. A small piece of static CMOS logic is introduced to the circuit to avoid...
Ki-Wook Kim, C. L. Liu, Sung-Mo Kang
AICT
2006
IEEE
109views Communications» more  AICT 2006»
14 years 3 months ago
Experiences in Deploying Services within the Axis Container
The Web Services framework, since it leverages the Service Oriented Architecture model, enables the development of applications that are loosely coupled and easier to manage. A We...
Beytullah Yildiz, Shrideep Pallickara, Geoffrey Fo...
MST
2006
99views more  MST 2006»
13 years 9 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe