Sciweavers

11 search results - page 1 / 3
» Vertex-minor reductions can simulate edge contractions
Sort
View
DAM
2007
111views more  DAM 2007»
13 years 4 months ago
Vertex-minor reductions can simulate edge contractions
We prove that local complementation and vertex deletion, operations from which vertexminors are defined, can simulate edge contractions. As an application, we prove that the rank...
Mamadou Moustapha Kanté
TON
2008
160views more  TON 2008»
13 years 4 months ago
Label space reduction in MPLS networks: how much can a single stacked label do?
Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying Virtual Private Networks (VPNs) and there...
Fernando Solano, Thomas Stidsen, Ramón Fabr...
SAT
2009
Springer
117views Hardware» more  SAT 2009»
13 years 11 months ago
Dynamic Symmetry Breaking by Simulating Zykov Contraction
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
Bas Schaafsma, Marijn Heule, Hans van Maaren
ICS
1993
Tsinghua U.
13 years 9 months ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
CN
2007
95views more  CN 2007»
13 years 5 months ago
Sampling large Internet topologies for simulation purposes
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
Vaishnavi Krishnamurthy, Michalis Faloutsos, Marek...