Sciweavers

3008 search results - page 354 / 602
» Independence in connected graphs
Sort
View
JSAT
2006
73views more  JSAT 2006»
15 years 6 months ago
Impurity: Another Phase Transition of SAT
It is well known that satisfiability of random sets of propositional clauses undergoes phase transition while the clause-to-variable ratio of the sets increases. We introduce anot...
Eliezer L. Lozinskii
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
15 years 6 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
Jochen Könemann, Stefano Leonardi, Guido Sch&...
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
15 years 6 months ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
ARSCOM
1998
79views more  ARSCOM 1998»
15 years 6 months ago
A characterization of halved cubes
The vertex set of a halved cube Qd consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then i...
Wilfried Imrich, Sandi Klavzar, Aleksander Vesel
ALGOSENSORS
2010
Springer
15 years 5 months ago
MSDR-D Network Localization Algorithm
Abstract. We present a distributed multi-scale dead-reckoning (MSDR-D) algorithm for network localization that utilizes local distance and angular information for nearby sensors. T...
Kevin Coogan, Varun Khare, Stephen G. Kobourov, Ba...