• Search: "G.2.2.0: Graph algorithms"

Showing 41 - 60 of 70

41

Exact Algorithm to Solve the Minimum Cost Multi-Constrained Multicast Routing Problem
Molnár, Miklós ; Methods, Algorithms for Operations REsearch (MAORE) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; et al.
Journal of Computer and Communications. 4(14):57-79

Branch and Bound Partial Minimum Spanning... Hierarchy Multi-Constrained Steine... Quality of Service Multicast Routing …
Journal
Save to List
42

Exact values for three domination-like problems in circular and infinite grid graphs of small height
Bouznif, Marwane ; Darlay, Julien ; Moncel, Julien ; et al.
Discrete Mathematics and Theoretical Computer Science. 3(3)

grid locating-total-dominatin... locating-dominating code identifying code graph algorithm ACM: G.: Mathematics of... …
Journal
Save to List
43

Détection de communautés recouvrantes orientée sommet
Canu, Maël ; Lesot, Marie-Jeanne ; Revault d'Allonnes, Adrien ; et al.

Cergy, France exploitation de graphes détection de communautés... méthodes orientées somme... MARAMI exploration de graphes …
Conference
Save to List
44

Understanding edge-connectivity in the Internet through core-decomposition
Alvarez-Hamelin, José Ignacio ; Mariano Gastón, Beiró ; Busch, Jorge Rodolfo ; et al.
Internet Mathematics. 7(1):45-66

connectivity core-decomposition algorithm visualization ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... …
Journal
Save to List
45

The readability of Path-Preserving Clusterings of Graphs
Archambault, Daniel ; Purchase, Helen ; Pinaud, Bruno ; et al.
Computer Graphics Forum. 29(3):1173-1182

ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory G.2.2.0: Graph algorithm... ACM: H.: Information Sys... H.1: MODELS AND PRINCIPL... …
Journal
Save to List
46

CycleExpander to construct Directed Hamiltonian Circuit HexCycleSpanner to tighten Directed Hamiltonian Circuit
Halemane, Keshava Prasad ; National Institute of Technology Karnataka [Surathkal] (NITK) ; SASHESHA
[Research Report] SASHESHA. 2022. :10-10

CycleExpander Algorithm Computational Complexity Asymmetric Travelling Sa... Shortest Directed Hamilt... HexCycleSpanner …
Report
Save to List
47

Spectral Measures of Distortion for Change Detection in Dynamic Graphs
Castelli Aleardi, Luca ; Salihoglu, Semih ; Singh, Gurprit ; et al.

ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory G.2.2.0: Graph algorithm... [INFO.INFO-CG]Computer S... Computational Geometry [... …
Electronic Resource
Save to List
48

Biological and Shortest-Path Routing Procedures for Transportation Network Design
Queyroi, François ; Géographie-cités (GC) ; Université Paris 1 Panthéon-Sorbonne (UP1)-Université Paris Diderot - Paris 7 (UPD7)-Ecole Normale Supérieure-Lettres et Sciences Humaines (ENS LSH)-Centre National de la Recherche Scientifique (CNRS)

transportation networks physarium solver evaluation optimization shortest-paths PARIS team …
Electronic Resource
Save to List
49

Topological Quadrangulations of Closed Triangulated Surfaces using the Reeb Graph
Hétroy, Franck ; Attali, Dominique ; Virtual environments for animation and image synthesis of natural objects (EVASION) ; et al.
Graphical Models. 65(1-3):131-148

Dijkstra's algorithm Reeb graph surface generators quadrangulation Triangulated surfaces ACM: I.: Computing Metho... …
Journal
Save to List
50

Linear Sum Assignment with Edition
Bougleux, Sébastien ; Brun, Luc ; Equipe Image - Laboratoire GREYC - UMR6072 ; et al.
[Research Report] Normandie Université; GREYC CNRS UMR 6072. 2016

Bipartite graph matching Edit Distance Hungarian Method Assignment Problem Assignment algorithms Matching Technique …
Report
Save to List
51

Ensuring the Drawability of Extended Euler Diagrams for up to 8 Sets
Verroust, Anne ; Viaud, Marie-Luce ; Image and multimedia indexing, browsing and retrieval (IMEDIA) ; et al.

Cambridge, United Kingdo... Euler diagrams ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory G.2.2.0: Graph algorithm... …
Conference
Save to List
52

Contact graphs of boxes with unidirectional contacts
Gonçalves, Daniel ; Limouzy, Vincent ; Ochem, Pascal ; et al.

ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory G.2.2.0: Graph algorithm... G.2.2.1: Graph labeling [INFO.INFO-DM]Computer S... …
Electronic Resource
Save to List
53

A Quadratic Assignment Formulation of the Graph Edit Distance
Bougleux, Sébastien ; Brun, Luc ; Carletti, Vincenzo ; et al.
[Research Report] Normandie Université; GREYC CNRS UMR 6072; LITIS. 2015

Combinatorial optimizati... Quadratic assignment pro... Edit paths Graph edit distance Structural pattern recog... Relaxation methods …
Report
Save to List
54

HABILITATION A DIRIGER DES RECHERCHES Graphes et jeux combinatoires
Duchene, Eric ; Graphes, AlgOrithmes et AppLications (GOAL) ; Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS) ; et al.
Combinatoire [math.CO]. Universite Claude Bernard Lyon 1, 2015

Combinatorial Game Theor... Graph theory Jeu de Nim Jeux combinatoires Théorie des graphes ACM: G.: Mathematics of... …
Report
Save to List
55

Oriented patterns in image analysis
ETUDE DES DIRECTIONS EN ANALYSE D'IMAGE
Oriented patterns in image analysis: From thin objects to flow-based methods
ETUDE DES DIRECTIONS EN ANALYSE D'IMAGE: Des objets fins aux méthodes à base de flot
Talbot, Hugues ; Laboratoire d'Informatique Gaspard-Monge (LIGM) ; Université Paris-Est Marne-la-Vallée (UPEM)-École nationale des ponts et chaussées (ENPC)-ESIEE Paris-Fédération de Recherche Bézout (BEZOUT) ; et al.
Image Processing [eess.IV]. Université Paris Est, 2013

Thin objects maximum flow texture total variation continuous flow segmentation …
Report
Save to List
56

ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges
Simonetto, Paolo ; Archambault, Daniel ; Auber, David ; et al.
Computer Graphics Forum. 30(3)

ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory G.2.2.0: Graph algorithm... [INFO.INFO-OH]Computer S... Other [cs.OH]
Journal
Save to List
57

Belief propagation : an asymptotically optimal algorithm for the random assignment problem
Salez, Justin ; Shah, Devavrat ; Theory of networks and communications (TREC) ; et al.
Mathematics of Operations Research, 2009

ACM: G.: Mathematics of... G.3: PROBABILITY AND STA... G.3.15: Stochastic proce... G.3.2: Distribution func... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory …
Journal
Save to List
58

Modeling, Analysis, Digital image representation Combinatorial approach of imagery
Modélisation, Analyse, Représentation des Images Numériques Approche combinatoire de l’imagerie
Fiorio, Christophe ; Image & Interaction (ICAR) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; et al.
Traitement des images [eess.IV]. Université Montpellier 2, 2008

combinatorial algorithms Digital image image processing digital topology region segmentation Combinatorial maps …
Report
Save to List
59

Algorithms for optimal guidance of users in road networks
Algorithmes de guidage optimal des usagers dans les réseaux routiers
Manseur, Farida ; Université Paris-Est Marne-la-Vallée (UPEM) ; Génie des Réseaux de Transport Terrestres et Informatique Avancée (IFSTTAR/COSYS/GRETTIA) ; et al.
Operations Research [math.OC]. MSTIC graduate school / University of Marne-la-vallée; GRETTIA / IFSTTAR, 2017. English. ⟨NNT : ⟩

Traffic control Optimization Robustness Travel-time reliability Optimal guidance Robustesse …
Dissertation/ Thesis
Save to List
60

On computing the Gromov hyperbolicity
Cohen, Nathann ; Coudert, David ; Lancin, Aurélien ; et al.
ACM Journal of Experimental Algorithmics. 20(1):18-18

Networks Gromov Hyperbolicity Algorithms ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory …
Journal
Save to List
Search Tools: Get RSS Feed Email this Search Save Search

Filter