Sciweavers

2310 search results - page 94 / 462
» Coloring Random Graphs
Sort
View
ENDM
2007
149views more  ENDM 2007»
13 years 10 months ago
Oriented vertex and arc colorings of partial 2-trees
d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an ori...
Pascal Ochem, Alexandre Pinlou
SAT
2005
Springer
133views Hardware» more  SAT 2005»
14 years 3 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
ALENEX
2007
105views Algorithms» more  ALENEX 2007»
13 years 11 months ago
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
Martin Kutz, Pascal Schweitzer
CORR
2007
Springer
121views Education» more  CORR 2007»
13 years 10 months ago
On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
— The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can signi...
Salim Y. El Rouayheb, Mohammad Asad R. Chaudhry, A...
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 10 months ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi