6740 search results - page 236 / 1348 » An s -Hamiltonian Line Graph Problem |
124
click to vote
WADS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
113
click to vote
AICCSA
2007
IEEE
15 years 7 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
84
Voted
ENDM
2008
15 years 22 days ago
2008
In this note we report on our recent work, still in progress, regarding Folkman numbers. Let f(2, 3, 4) denote the smallest integer n such that there exists a K4
133
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
109
click to vote
ACTA
2008
15 years 25 days ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...