Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Distance (graph theory)

Related publications (26)

A 2D typology generator for historical masonry elements

Katrin Beyer, Shenghan Zhang

The mechanical response of stone masonry depends on the properties of the components and also on the typology created by the stone units and the mortar joints. While the influence of the component strength on masonry is relatively well studied, few studies ...

2018

Cortical Dysconnectivity Measured by Structural Covariance Is Associated With the Presence of Psychotic Symptoms in 22q11.2 Deletion Syndrome

Dimitri Nestor Alice Van De Ville, Marie Schaer, Maude Schneider

BACKGROUND: 22q11.2 deletion syndrome (22q11DS) is the third-largest known genetic risk factor for the development of psychosis. Dysconnectivity has consistently been implicated in the physiopathology of psychosis. Structural covariance of cortical morphol ...

2018

When Stuck, Flip a Coin : New Algorithms for Large-Scale Tasks

Slobodan Mitrovic

Many modern services need to routinely perform tasks on a large scale. This prompts us to consider the following question: How can we design efficient algorithms for large-scale computation? In this thesis, we focus on devising a general strategy to addr ...

EPFL2018

Constant factor approximation for ATSP with two edge weights

Ola Nils Anders Svensson, Jakub Tarnawski

We give a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights. For the case of unit edge weights, the first constant factor approximation was give ...

SPRINGER HEIDELBERG2018

Analytical transport network theory to guide the design of 3-D microstructural networks in energy materials: Part 1. Flow without reactions

Arata Nakajo

We present a fully analytical, heuristic model the "Analytical Transport Network Model" for steady-state, diffusive, potential flow through a 3-D network. Employing a combination of graph theory, linear algebra, and geometry, the model explicitly relates a ...

Elsevier Science Bv2017

On Simplices in Diameter Graphs in R-4

Andrei Kupavskii

A graph G is a diameter graph in R-d if its vertex set is a finite subset in R-d of diameter 1 and edges join pairs of vertices a unit distance apart. It is shown that if a diameter graph G in R-4 contains the complete subgraph K on five vertices, then any ...

Maik Nauka/Interperiodica/Springer2017