Concept

Universal vertex

Related publications (41)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Delaunay Graphs of Point Sets in the Plane With Respect to Axis-Parallel Rectangles

János Pach, Gábor Tardos

Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q is an element of P are connected by an edge if and only if there is a rectangle parallel to the coor ...

Wiley-Blackwell2009

Partitioning graphs into complete and empty graphs

Tinaz Ekim

Given integers j and k and a graph G, we consider partitions of the vertex set of G into j + k parts where j of these parts induce empty graphs and the remaining k induce cliques. If such a partition exists, we say G is a (j, k)-graph. For a fixed j and k ...

2009

Parity-regular Steinhaus graphs

Maxime Augier

Steinhaus graphs on n vertices are certain simple graphs in bijective correspondence with binary {0,1}-sequences of length n-1. A conjecture of Dymacek in 1979 states that the only nontrivial regular Steinhaus graphs are those corresponding to the periodic ...

American Mathematical Society2008

SONDe, a Self-Organizing Object Deployment Algorithm in Large-Scale Dynamic Systems

Anne-Marie Kermarrec, Vincent Gramoli

We present the design, correctness, and analysis of SONDe, a simple fully decentralized object deployment algorithm for highly requested systems. Given an object (service or data), SONDe provides a node with a constant upper bound (h) on the number of logi ...

2008

Variable space search for graph coloring

Nicolas Zufferey, Matthieu Plumettaz

Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, ..., k}) to each vertex of G so that no edge has both endpoints with the same color. We propose a new local search methodology, ...

2008

Constrained paths in the flip-graph of regular triangulations

Thomas Liebling, Lionel Pournin

We describe particular paths in the flip-graph of regular triangulations in any dimension. It is shown that any pair of regular triangulations is connected by a path along which none of their common faces are destroyed. As a consequence, we obtain the conn ...

2007

(k,lambda)-colorings and universal graphs

Ivo Blöchliger, Daniela Bronner

We consider vertex k-colorings of an arbitrary simple, connected, and undirected graph G=(V,E) such that, for every vertex v, at most lambda different colors occur in the closed neighborhood of v. These colorings are called (k,lambda)-colorings. If a graph ...

2006

Suboptimal colorings and solution of large chromatic scheduling problems

Ivo Blöchliger

Graph Coloring is a very active field of research in graph theory as well as in the domain of the design of efficient heuristics to solve problems which, due to their computational complexity, cannot be solved exactly (no guarantee that an optimal solution ...

EPFL2005

Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron

Thomas Liebling, François Margot

In this paper, we investigate the applicability of backtrack technique to solve the vertex enumeration problem and the face enumeration problem for a convex polyhedron given by a system of linear inequalities. We show that there is a linear-time backtrack ...

1997

A simple heuristic for the optimal enclosed area polygon problem

Thomas Liebling, Jean-François Hêche

We present a simple constructive heuristic for the optimal enclosed area polygon problem. Namely, given a finite set S of points in the plane, we look for the simple polygon with vertex set S having minimal, respectively maximal, enclosed area. ...

1996