Publications related to Apollonian network

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.

Grammar-based generation of bar networks in static equilibrium with bounded bar lengths

Corentin Jean Dominique Fivet, Ioannis Mirtsopoulos

This paper presents a generative approach for the conceptual design of structures, which aims at exploring alternative bar networks in static equilibrium by means of a grammar rule. Operating on incomplete networks of bars in interim static equilibrium, th ...

2021

Manycore clique enumeration with fast set intersections

Paolo Ienne, Kubilay Atasu, Radu Ioan Stoica, Jovan Blanusa

Listing all maximal cliques of a given graph has important applications in the analysis of social and biological networks. Parallelisation of maximal clique enumeration (MCE) algorithms on modern manycore processors is challenging due to the task-level par ...

ACM2020

Grammar-based generation of trusses within non-convex domains

Corentin Jean Dominique Fivet, Ioannis Mirtsopoulos

A force-driven generative grammar rule is proposed as a design exploration method for planar networks in static equilibrium within non-convex domains. The aim is to enrich the catalog of unconventional structural typologies. Empty or partial networks in eq ...

fib2019

Filtering Random Graph Processes Over Random Time-Varying Graphs

Andreas Loukas

Graph filters play a key role in processing the graph spectra of signals supported on the vertices of a graph. However, despite their widespread use, graph filters have been analyzed only in the deterministic setting, ignoring the impact of stochasticity i ...

Institute of Electrical and Electronics Engineers2017

Computation in Multicast Networks: Function Alignment and Converse Theorems

Michael Christoph Gastpar, Naveen Goela

The classical problem in a network coding theory considers communication over multicast networks. Multiple transmitters send independent messages to multiple receivers that decode the same set of messages. In this paper, computation over multicast networks ...

Institute of Electrical and Electronics Engineers2016

On vertices and facets of combinatorial 2-level polytopes

Yuri Faenza, Manuel Francesco Aprile, Alfonso Bolívar Cevallos Manzano

2-level polytopes naturally appear in several areas of mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. We investigate upper bounds on the product of the number of facets and the number ...

Springer2016

Outerplanar graph drawings with few slopes

Bartosz Maria Walczak

We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions. We prove that Delta - 1 edge slopes suffic ...

Elsevier Science Bv2014

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

Apollonian network

Graph Chatbot

Chat with Graph Search

Grammar-based generation of bar networks in static equilibrium with bounded bar lengths

Manycore clique enumeration with fast set intersections

Grammar-based generation of trusses within non-convex domains

Filtering Random Graph Processes Over Random Time-Varying Graphs

The weighted stable matching problem

Computation in Multicast Networks: Function Alignment and Converse Theorems

From data to structures

On vertices and facets of combinatorial 2-level polytopes

Outerplanar graph drawings with few slopes

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

Grammar-based generation of bar networks in static equilibrium with bounded bar lengths

Manycore clique enumeration with fast set intersections

Filtering Random Graph Processes Over Random Time-Varying Graphs

Outerplanar graph drawings with few slopes

Grammar-based generation of trusses within non-convex domains

The weighted stable matching problem

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

Computation in Multicast Networks: Function Alignment and Converse Theorems

From data to structures

On vertices and facets of combinatorial 2-level polytopes