Publications associées à Graphe nul

Deprogramming Large Software Systems

Developers turn ideas, designs and patterns into source code, then compile the source code into executables. Decompiling turns executables back into source code, and deprogramming turns code back into designs and patterns. In this paper we introduce DeP, a ...

2008

Densification Arising from Sampling Fixed Graphs

Matthias Grossglauser, Pedram Pedarsani

During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer networks. A recently observed feature is known as network densification, which ...

ACM2008

On a graph coloring problem arising from discrete tomography

Dominique de Werra, Bernard Ries

An extension of the basic image reconstruction problem in discrete tomography is considered: given a graph

G=(V,E)

and a family

\mathcal{P}

of chains

P_i

together with vectors

h(P_i)=(h_{i}^{1},...,h_{i}^{k})

, one wants to find a partition $V^{1},. ...

2008

On two coloring problems in mixed graphs

Dominique de Werra, Bernard Ries

We are interested in coloring the vertices of a mixed graph, i.e., a graph containing edges and arcs. We consider two different coloring problems: in the first one we want adjacent vertices to have different colors and the tail of an arc to get a color str ...

2008

Polar cographs

Dominique de Werra, Tinaz Ekim

Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a partition A, B of its vertex set such that A induces a complete s-partite grap ...

Elsevier2008

A graph coloring heuristic using partial solutions and a reactive tabu scheme

Nicolas Zufferey

Most of the recent heuristics for the graph coloring problem start from an infeasible k-coloring (adjacent vertices may have the same color) and try to make the solution feasible through a sequence of color exchanges. In contrast, our approach (called FOO- ...

2008

Bicolored matchings in some classes of graphs

Dominique de Werra, Bernard Ries

We consider the problem of finding in a graph a set

R

of edges to be colored in red so that there are maximum matchings having some prescribed numbers of red edges. For regular bipartite graphs with

n

nodes on each side, we give sufficient conditions f ...

2007

Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings

Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp, Jörg Widmer

Routing packets is a central function of multi-hop wireless networks. Traditionally, there have been two paradigms for routing, either based on the geographical coordinates of the nodes (geographic routing), or based on the connectivity graph (topology-bas ...

2007

A Strategy Based on Maximum Spanning Trees to Stitch Together Microscope Images

Michaël Unser, Philippe Thévenaz

Assembling partial views is an attractive means to extend the field of view of microscope images. In this paper, we propose a semi-automated solution to achieve this goal. Its intended audience is the microscopist who desires to scan a large area while acq ...

SPIE2006

Graphical Comparison of Image Analysis and Laser Diffraction Particle, Size Analysis Data Obtained From the Measurements of Nonspherical Particle Systems

Paul Bowen

The purpose of this paper is to describe results from the use of a set of Excel macros written to facilitate the comparison of image analysis (IA) and laser diffraction (LD) particle size analysis (psa) data. Measurements were made on particle systems of d ...

2006

Graphe nul

Graph Chatbot

Chattez avec Graph Search

Deprogramming Large Software Systems

Densification Arising from Sampling Fixed Graphs

On a graph coloring problem arising from discrete tomography

On two coloring problems in mixed graphs

Polar cographs

A graph coloring heuristic using partial solutions and a reactive tabu scheme

Bicolored matchings in some classes of graphs

Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings

A Strategy Based on Maximum Spanning Trees to Stitch Together Microscope Images

Graphical Comparison of Image Analysis and Laser Diffraction Particle, Size Analysis Data Obtained From the Measurements of Nonspherical Particle Systems

Deprogramming Large Software Systems

Polar cographs

On a graph coloring problem arising from discrete tomography

A graph coloring heuristic using partial solutions and a reactive tabu scheme

On two coloring problems in mixed graphs

Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings

Bicolored matchings in some classes of graphs

A Strategy Based on Maximum Spanning Trees to Stitch Together Microscope Images

Graphical Comparison of Image Analysis and Laser Diffraction Particle, Size Analysis Data Obtained From the Measurements of Nonspherical Particle Systems

Densification Arising from Sampling Fixed Graphs