Concept

Hasse diagram

Related publications (8)

Dynamic environmental flows using hydrodynamic-based solutions for sustainable hydropower

Water diversions from rivers and torrents for anthropic uses of the resource alter the natural flow regime. As a measure, environmental flows have been prescribed and often are enforced by law to follow policies (e.g., minimal flow, proportional redistribu ...

CRC Press/Balkema2023

, ,

The use of supplementary cementitious materials as a partial replacement for Portland cement is the most effective way to reduce the carbon footprint of the concrete industry. Raw clays containing kaolinite (kaolin) are promising substitute materials. In t ...

SPRINGER2020

Thermodynamic re-assessment of the Zn–P binary system

Anna Fontcuberta i Morral, Elias Zsolt Stutz, Mahdi Zamani, Simon Robert Escobar Steinvall

Thermodynamic phase diagrams are the cornerstones to develop synthesis of new materials. Zinc phosphide has evolved into a prospective semicontuctor for next generation solar cells, thanks to its abundance and functional properties. Here we derive an optim ...

2019

We demonstrated 5 mm-thick bulk gallium nitride (GaN) with nearly perfect crystal quality. To achieve this, intentional etch pit formation by in situ dry HCl etching and ex situ wet etching in H3PO4 solution was employed on freestanding GaN templates follo ...

Royal Soc Chemistry2017

In this paper we study the page number of upward planar directed acyclic graphs. We prove that the page number of any upward planar directed acyclic graph G is a function of the page number of a four-connected subgraph of G; further, we provide an upper bo ...

Springer Berlin Heidelberg2012

This thesis is devoted to crossing patterns of edges in topological graphs. We consider the following four problems: A thrackle is a graph drawn in the plane such that every pair of edges meet exactly once: either at a common endpoint or in a proper crossi ...

EPFL2012

On the Page Number of Upward Planar Directed Acyclic Graphs

Radoslav Fulek, Fabrizio Frati, Andres Jacinto Ruiz Vargas

In this paper we study the page number of upward planar directed acyclic graphs. We prove that: (I) the page number of any n-vertex upward planar triangulation G whose every maximal 4-connected component has page number k is at most min {O(k log n), O(2(k) ...

Springer-Verlag Berlin2011

, ,

We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a graph with n vertices admits a RAC drawing with at most 1 bend or 2 bends pe ...

2010

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.