Publication

A full characterization of invariant embeddability of unimodular planar graphs

Publications associées (225)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Deprogramming Large Software Systems

George Candea, Yohann Coppel

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

Visual Debugging of MPI Applications

Roger Hersch, Ali Al-Shabibi

We present the design and implementation of a debugging tool that displays a message-passing graph of the execution of an MPI application. Parts of the graph can be hidden or highlighted based on the stack trace, calling process or communicator of MPI call ...

Springer2008

Dynamic Testing of Flow Graph Based Parallel Applications

Roger Hersch

In message-passing parallel applications, messages are not delivered in a strict order. The number of messages, their content and their destination may depend on the ordering of their delivery. Nevertheless, for most applications, the computation results s ...

ACM2008

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

Variations of coloring problems related to scheduling and discrete tomography

Bernard Ries

The graph coloring problem is one of the most famous problems in graph theory and has a large range of applications. It consists in coloring the vertices of an undirected graph with a given number of colors such that two adjacent vertices get different col ...

EPFL2007

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

Coloring some classes of mixed graphs

Bernard Ries

We consider the coloring problem for mixed graphs, that is, for graphs containing edges and arcs. A mixed coloring

c

is a coloring such that for every edge

[x_{i},x_{j}]

c(x_{i})\neq c(x_{j})

and for every arc

(x_{p},x_{q})

, $c(x_{p})

2007

An introduction to treewidth

Bernard Ries, Daniela Bronner

The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. A lot of problems, which are in general

NP

-complete, can be solved in polynomial time for graphs with small treewidth. In the first part of this paper we presen ...

2006

Generalized connection graph method for synchronization in asymmetrical networks

Martin Hasler, Igor Belykh

We present a general framework for studying global complete synchronization in networks of dynamical systems with asymmetrical connections. We extend the connection graph stability method, originally developed for symmetrically coupled networks, to the gen ...

2006

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

An introduction to treewidth

Bernard Ries, Daniela Bronner

The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. A lot of problems, which are in general

NP

-complete, can be solved in polynomial time for graphs with small treewidth. In the first part of this paper we presen ...

2006

Coloring some classes of mixed graphs

Bernard Ries

We consider the coloring problem for mixed graphs, that is, for graphs containing edges and arcs. A mixed coloring

c

is a coloring such that for every edge

[x_{i},x_{j}]

c(x_{i})\neq c(x_{j})

and for every arc

(x_{p},x_{q})

, $c(x_{p})

2007