Dictionnaire français - anglais

k-arête-connexe

sciences naturelles et appliquées - techdico
A better approximation ratio for the minimum size k-edge-connected spanning subgraph problemConsider the minimum size k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, nd a k-edge-connected spanning subgraph of G with the minimum number of ...
général - core.ac.uk - PDF: citeseerx.ist.psu.edu
Linear-time enumeration of maximal k-edge-connected subgraphs in large networks by random contraction... The idea of using maximal k-edge-connected subgraphs was recently proposed to address this issue....
Parity constrained k-edge-connected orientations... The main result is a characterization of undirected graphs G = (V; E) having a k-edge-connected T -odd orientation for every subset T ' V with jEj + jT j even....
A better approximation ratio for the minimum k-edge-connected spanning subgraphConsider the minimum k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, find a k-edge-connected spanning subgraph of G with minimum number of edges....


1 milliard de traductions classées par domaine d'activité en 28 langues