Concept

Tutte embedding

Related publications (25)

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.

Free Edge Lengths in Plane Graphs

Radoslav Fulek, Filip Moric

We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph of a planar graph H (where H is the "host" of G). The graph G is free in H if for every choice of positive lengths for the edges of G, the host H has a pla ...

Springer2015

An Intercomparison of LES Subgrid-Scale Models for Simulations of Slope Flows

Jiannong Fang, Marc Parlange, Marco Giovanni Giometto

We propose an inter-comparison of Smagorinsky type subgrid-scale models for the simulation of high Reynolds number katabatic flows, with the purpose of testing the validity of some of the model's assumptions for the considered application. Katabatic flows ...

2014

Tangles and Degenerate Tangles

Andres Jacinto Ruiz Vargas

We study some variants of Conway’s thrackle conjecture. A tangle is a graph drawn in the plane such that its edges are represented by continuous arcs, and any two edges share precisely one point, which is either a common endpoint or an interior point at wh ...

Springer Berlin Heidelberg2013

Universal Sets for Straight-Line Embeddings of Bicolored Graphs

Jan Kyncl

A set S of n points is 2-color universal for a graph G on n vertices if for every proper 2-coloring of G and for every 2-coloring of S with the same sizes of color classes as G has, G is straight-line embeddable on S. We show that the so-called double chai ...

2011

An iterative surface model for timber construction

Yves Weinand, Ivo Stotz, Gilles Gouaty

In the field of timber construction, we work on surface design that is based on an iterative model called "IFS" (Iterated Function System). The modeled figures must meet certain properties in order to ensure their physical feasibility. For the construction ...

CRC Press/Balkema Taylor & Francis Group2010

Constructing Convex Planes In The Pants Complex

Hugo Parlier

Our main theorem identifies a class of totally geodesic subgraphs of the 1-skeleton of the pants complex, referred to as the pants graph, each isomorphic to the product of two Farey graphs. We deduce the existence of many convex planes in the pants graph o ...

2009

The stable set polytope of quasi-line graphs

Friedrich Eisenbrand, Gautier Stauffer

It is a long standing open problem to find an explicit description of the stable set polytope of claw-free graphs. Yet more than 20 years after the discovery of a polynomial algorithm for the maximum stable set problem for claw-free graphs, there is even n ...

2008

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

The diffusion of Radon Shape

Victor Panaretos

In 1977, D. G. Kendall [J. Appl. Probab. 28 (1991), no. 1, 225--230; MR1090460 (92f:60135)] considered diffusions of shape induced by independent Brownian motions in Euclidean space. In this paper, we consider a different class of diffusions of shape, indu ...

2006

Generalized vertex coloring problems using split graphs

Tinaz Ekim

Graph theory experienced a remarkable increase of interest among the scientific community during the last decades. The vertex coloring problem (Min Coloring) deserves a particular attention rince it has been able to capture a wide variety of applications. ...

EPFL2006