-
Scheduled-PEG construction of LDPC codes for Upper-Layer FEC
International audience -
Choosability of bipartite graphs with maximum degree $Delta$
Let G=(V(G), E(G)) be a graph. A list assignment is an assignment of a set L(v) of integers to every vertex v of G. An L-colouring is an application C from V(G) into... -
A Proposition for Fixing the Dimensionality of a Laplacian Low-rank Approxima...
International audience -
L'analyse des graphes bipartis
This working paper from the group fmr (flux, matrices, réseaux) presents available methods to analyze bipartite graphs: local and global measures, cliques and... -
On the NP-Completeness of the Perfect Perfect Matching Free Subgraph Problem
Given a bipartite graph G = (U υ V,E) such that |U| = |V | and every edge is labelled true or false or both, the perfect matching free subgraph problem is to determine... -
On the proper orientation number of bipartite graphs
An {\it orientation} of a graph~$G$ is a digraph~$D$ obtained from~$G$ by replacing each edge by exactly one of the two possible arcs with the same endvertices. For...
