• Suche: "G.2.2.0: Graph algorithms"

Treffer 1 - 20 von 70

1

Bipartite-Based 2-Approximation for Dominating Sets in General Graphs
Vega, Frank ; Information Physics Institute (IPI)

Graph Theory Combinatorial Optimizati... Bipartite Graphs Approximation Algorithms Polynomial-Time Complexi... 68Q25, 68R10 …
E-Ressource
Zu den Favoriten
2

A Linear-Time Solution to the Triangle Finding Problem: The Aegypti Algorithm
Vega, Frank ; Information Physics Institute (IPI)

Graph Theory Triangle-free graphs Depth-First Search Linear time Enumeration 68Q25, 68R10 …
E-Ressource
Zu den Favoriten
3

A 2-Approximation Algorithm for Dominating Sets
Vega, Frank ; Information Physics Institute (IPI)

Graph Theory Combinatorial Optimizati... Chordal Graphs Approximation Algorithms Polynomial-Time Complexi... 68Q25, 68R10 …
E-Ressource
Zu den Favoriten
4

A Linear-Time Solution to the Triangle Finding Problem: The Aegypti Algorithm
Vega, Frank ; Information Physics Institute (IPI)

ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory G.2.2.0: Graph algorithm... [INFO.INFO-CC]Computer S... Computational Complexity... …
E-Ressource
Zu den Favoriten
5

New Insights and Developments on the Triangle Finding Problem
Vega, Frank ; Information Physics Institute (IPI)

Triangle-free graphs Enumeration Graph Theory Depth-First Search Linear time 68Q25, 68R10 …
E-Ressource
Zu den Favoriten
6

New Insights and Developments on the Vertex Cover Problem
Vega, Frank ; Information Physics Institute (IPI)

Graph Theory Vertex Cover Dominating Set Chordal Graphs Polynomial-Time Complexi... 68Q25, 68R10 …
E-Ressource
Zu den Favoriten
7

New Insights and Developments on the Triangle Finding Problem
Vega, Frank ; Information Physics Institute (IPI)

Triangle-free graphs Enumeration Graph Theory Depth-First Search Linear time 68Q25, 68R10 …
E-Ressource
Zu den Favoriten
8

New Insights and Developments on the Unique Games Conjecture
Vega, Frank ; Information Physics Institute (IPI)

Unique Games Conjecture Optimization Problem Approximation Algorithm Graph Theory Computational Complexity 68Q25, 68R10 …
E-Ressource
Zu den Favoriten
9

SAT in Polynomial Time: A Proof of P = NP
Vega, Frank ; Information Physics Institute (IPI)

complexity classes matching techniques polynomial time completeness reduction 68Q15, 68Q17, 68Q25 …
E-Ressource
Zu den Favoriten
10

SAT in Polynomial Time: A Proof of P = NP
Vega, Frank ; Information Physics Institute (IPI)

complexity classes matching techniques polynomial time completeness reduction 68Q15, 68Q17, 68Q25 …
E-Ressource
Zu den Favoriten
11

The Triangle Finding Problem
Vega, Frank ; Information Physics Institute (IPI)

Triangle finding Triangle enumeration Graph theory Depth-first search (DFS) Linear time algorithm ACM: G.: Mathematics of... …
E-Ressource
Zu den Favoriten
12

SAT in Polynomial Time: A Proof of P = NP
Vega, Frank ; Information Physics Institute (IPI)

complexity classes graph polynomial time completeness reduction 68Q15, 68Q17, 68Q25 …
E-Ressource
Zu den Favoriten
13

Kernelized multi-graph matching
Appariement multiple de graphes avec des noyaux
Dupé, François-Xavier ; Yadav, Rohit ; Auzias, Guillaume ; et al.
14th Asian Conference on Machine Learning (ACML 2022), Dec 2022, Hyderabad, India

Hyderabad, India ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory G.2.2.0: Graph algorithm... G.1: NUMERICAL ANALYSIS …
Konferenz
Zu den Favoriten
14

Industry 4.0 and Microservices with the power of Graphs
Farsi, Hassan ; Institut national des postes et télécommunications (INPT)
International Workshop of Services and Industry of the Future (IWSIF 2022), Oct 2022, Rabat, Morocco

Rabat, Morocco Industry 40 Microservices Graph theory analysis Graph algorithms Digitalisation …
Konferenz
Zu den Favoriten
15

Partitioning Wide Area Graphs Using a Space Filling Curve
Partitionnement de graphes large échelle à l'aide d'une courbe de remplissage
Gottstein, Cyprien ; Parvedy, Philippe Raipin ; Hurfin, Michel ; et al.
International Journal of Data Mining & Knowledge Management Process. 11(1):13-31

Space Filling Curve Geometric Geography Spatial Geometric partitioning Graph partitioning …
Zeitschrift
Zu den Favoriten
16

A Bilevel Model for the Frequency Setting Problem
Gatt, Hector ; Freche, Jean-Marie ; Laurent, Arnaud ; et al.
ATMOS 2022 : International Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Sep 2022, Potsdam, Germany. ⟨10.4230/OASIcs.ATMOS.2022.5⟩

Potsdam, Germany Frequency Setting, Servi... MESH: Frequency Setting MESH: Service Performanc... MESH: Bilevel MESH: Passenger Assignme... …
Konferenz
Zu den Favoriten
17

Continuous Relaxation of MAP Inference: A Nonconvex Perspective
Lê-Huu, Ð.Khuê ; Paragios, Nikos ; Organ Modeling through Extraction, Representation and Understanding of Medical Image Content (GALEN) ; et al.
CVPR 2018 - IEEE Conference on Computer Vision and Pattern Recognition. :1-19

Salt Lake City, United S... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory G.2.2.1: Graph labeling G.2.2.2: Hypergraphs …
Konferenz
Zu den Favoriten
18

Comparing heuristics for graph edit distance computation
Comparaison d'heuristiques pour le calcul de la distance d'édition entre graphes.
Blumenthal, David ; Boria, Nicolas ; Gamper, Johann ; et al.
The VLDB Journal. 29(1):419-458

Graph databases Similarity search Empirical evaluation Graph edit distance ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... …
Zeitschrift
Zu den Favoriten
19

A Column Generation-Based Heuristic for the Line Planning Problem with Service Levels
Gatt, Hector ; Freche, Jean-Marie ; Lehuédé, Fabien ; et al.
OASIcs. 96(OASIcs, Volume 96, ATMOS 2021https://www.dagstuhl.de/dagpub/978-3-95977-213-6)

Lisbon, Portugal Line Planning Network Design Column Generation Service Performance ACM: G.: Mathematics of... …
Konferenz
Zu den Favoriten
20

A generative model for sparse, evolving digraphs
Papoudakis, Georgios ; Preux, Philippe ; Monperrus, Martin ; et al.
6th International Conference on Complex Networks and their Applications. :531-542

Lyon, France ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory G.2.2.0: Graph algorithm... G.2.2.3: Network problem... …
Konferenz
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter