Concept

Component (graph theory)

Related publications (142)

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.

Sequential Group Testing with Graph Constraints

Amin Karbasi, Morteza Zadimoghaddam

In conventional group testing, the goal is to detect a small subset of defecting items

\mathcal{D}

in a large population

\mathcal{N}

by grouping \textit{arbitrary} subset of

\mathcal{N}

into different pools. The result of each group test $\mathcal{T} ...

Ieee2012

Compatible Component Selection Under Uncertainty Via Extended Constraint Satisfaction Approach

Paul Xirouchakis, Duck Young Kim

This paper deals with compatible component selection problems, where the goal is to find combinations of components satisfying design constraints given a product structure, component alternatives available in design catalogue for each subsystem of the prod ...

Univ Cincinnati Industrial Engineering2012

Clustering with Multi-Layer Graphs: A Spectral Perspective

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Observational data usually comes with a multimodal nature, which means that it can be naturally represented by a multi-layer graph whose layers share the same set of vertices (users) with different edges (pairwise relationships). In this paper, we address ...

Institute of Electrical and Electronics Engineers2012

Cohomology of GKM fiber bundles

Silvia Sabatini

The equivariant cohomology ring of a GKM manifold is isomorphic to the cohomology ring of its GKM graph. In this paper we explore the implications of this fact for equivariant fiber bundles for which the total space and the base space are both GKM and deri ...

Springer Verlag2012

Degrees of freedom of sparsely connected wireless networks

Michael Christoph Gastpar, Naveen Goela

We investigate how the network connectivity can affect the degrees of freedom (DoF) of wireless networks. We consider a network of n source-destination (SD) pairs and assume that any two nodes are connected with a positive probability p, independent of oth ...

IEEE2012

Microsimulation Framework for Urban Price-Taker Markets

Bilal Farooq

In the context of integrated transportation and other urban engineering infrastructure systems, there are many examples of markets, where consumers exhibit price-taking behaviour. While this behaviour is ubiquitous, the underlying mechanism can be captured ...

2011

Microsimulation Framework for Urban Price-Taker Markets

Bilal Farooq

2011

Exploring Spatial Characteristics of Urban Transportation Networks

Nikolaos Geroliminis, Yuxuan Ji

It has been shown recently that a Macroscopic Fundamental Diagram (MFD) exists in urban transportation networks under certain conditions. However, MFD is not universally expected. Previous research demonstrates the existence of MFDs in homogeneous networks ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Disjoint homometric sets in graphs

János Pach

Two subsets of vertices in a graph are called homometric if the multisets of distances determined by them are the same. Let h(n) denote the largest number h such that any connected graph of n vertices contains two disjoint homometric subsets of size h. It ...

2011

Decoding brain states from fMRI connectivity graphs

Dimitri Nestor Alice Van De Ville, Jonas Richiardi

Functional connectivity analysis of fMRI data can reveal synchronised activity between anatomically distinct brain regions. Here, we extract the characteristic connectivity signatures of different brain states to perform classification, allowing us to deco ...

2011

Sequential Group Testing with Graph Constraints

Amin Karbasi, Morteza Zadimoghaddam

In conventional group testing, the goal is to detect a small subset of defecting items

\mathcal{D}

in a large population

\mathcal{N}

by grouping \textit{arbitrary} subset of

\mathcal{N}

into different pools. The result of each group test $\mathcal{T} ...

Ieee2012