Concept

Regular graph

Related publications (51)

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.

Introducing dynamicity in JavaBIP

The JavaBIP framework allows the coordination of software components in an exogenous manner, while clearly separating the functional and coordination aspects of the system behaviour. JavaBIP implements the principles of the BIP component framework rooted i ...

2016

A hybrid computational model to predict chemotactic guidance of growth cones

Silvestro Micera

The overall strategy used by growing axons to find their correct paths during the nervous system development is not yet completely understood. Indeed, some emergent and counterintuitive phenomena were recently described during axon pathfinding in presence ...

Nature Publishing Group2015

On sums of graph eigenvalues

Joachim Stubbe

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both the standard combi ...

Elsevier Science Inc2014

Diameter Graphs in R-4

Andrei Kupavskii

A diameter graph in is a graph whose set of vertices is a finite subset of and whose set of edges is formed by pairs of vertices that are at diameter apart. This paper is devoted to the study of different extremal properties of diameter graphs in and on a ...

Springer2014

Segmenting Planar Superpixel Adjacency Graphs w.r.t. Non-planar Superpixel Affinity Graphs

Engin Türetken

We address the problem of segmenting an image into a previously unknown number of segments from the perspective of graph partitioning. Specifically, we consider minimum multicuts of superpixel affinity graphs in which all affinities between non-adjacent su ...

2013

Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back

Aleksander Madry

We present an O(m^10/7) = O(m^1.43)-time algorithm for the maximum s-t flow and the minimum s-t cut problems in directed graphs with unit capacities. This is the first improvement over the sparse-graph case of the long-standing O(m min{m^1/2, n^2/3}) runni ...

IEEE2013

A result on flip-graph connectivity

Lionel Pournin

A polyhedral subdivision of a d-dimensional point configuration A is k-regular if it is projected from the boundary complex of a polytope with dimension at most d+k. Call γk(A) the subgraph induced by k-regular triangulations in the flip-graph of A. Gel’fa ...

Walter de Gruyter2012

Lifting simplicial complexes to the boundary of convex polytopes

Lionel Pournin

Abstract: A simplicial complex C on a d-dimensional configuration of n points is k-regular if its faces are projected from the boundary complex of a polytope with dimension at most d+k. Since C is obviously (n-d-1)-regular, the set of all integers k for wh ...

Elsevier2012

Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion

Yu Lin, Mingfu Shao

Computing the edit distance between two genomes under certain operations is a basic problem in the study of genome evolution. The double-cut-and-join (DCJ) model has formed the basis for most algorithmic research on rearrangements over the last few years. ...

Biomed Central Ltd2012

Computing symmetric nonnegative rank factorizations

An algorithm is described for the nonnegative rank factorization (NRF) of some completely positive (CP) matrices whose rank is equal to their CP-rank. The algorithm can compute the symmetric NRF of any nonnegative symmetric rank-r matrix that contains a di ...

Elsevier2012