4865 search results - page 526 / 973 » The Complexity of Graph Connectivity |
158
click to vote
JETAI
2002
15 years 6 months ago
2002
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algo...
220
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
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,...
173
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
We numerically investigate the epidemic spread phenomena and efficient immunization strategies on complex networks embedded in geometry. It is assumed that there exists an unavoida...
189
click to vote
ISCAS
2007
IEEE
16 years 1 months ago
2007
IEEE
— A method is presented to synthesize wideband linear-phase FIR filters with a piecewise-polynomial-sinusoidal impulse response. The proposed method is based on merging the earl...
211
click to vote
IPCCC
2005
IEEE
16 years 19 days ago
2005
IEEE
The Double Authentication (DA) scheme presented in [1] is designed to provide security against impersonation attack to link state routing protocol at a lower computational cost as...