• Suche: "Graph algorithms"

Treffer 201 - 220 von 20.104

201

Filtering the noise in consensual community detection
Huchet, Antoine ; Guillaume, Jean-Loup ; Ghamri-Doudane, Yacine ; et al.

Le havre, France Real Graphs Graph Algori... Real Graphs Graph Algorithms Consensual Communities Noise …
Konferenz
Zu den Favoriten
202

A dual-layer dynamic graph summarization method based on extendable suffix fingerprints.
Liu, Qiang ; Zhao, Longlong ; Cao, He ; et al.
Future Generation Computer Systems. Mar2026, Vol. 176, pN.PAG-N.PAG. 1p.

GRAPH algorithms COMPUTER performance
Fachzeitschrift
Zu den Favoriten
203

ContraMST: A unified framework for dynamic MST maintenance.
Dwivedi, Akanksha ; Sankar Banerjee, Dip
Future Generation Computer Systems. Mar2026, Vol. 176, pN.PAG-N.PAG. 1p.

PARALLEL programming DATA structures ALGORITHMS GRAPH algorithms SCIENTIFIC computing COMPUTER performance
Fachzeitschrift
Zu den Favoriten
204

Visualisation automatique de graphes pour l’apprentissage des algorithmes
Baron, Pierre ; Roche, Laurent ; Raffaillac, Thibault ; et al.
10e Conférence sur les Environnements Informatiques pour l’Apprentissage Humain. :373-376

Fribourg, Switzerland interactive visualizatio... computer learning programming graph algorithms autonomy …
Konferenz
Zu den Favoriten
205

Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice
Georgiadis, Loukas ; Giannis, Konstantinos ; Italiano, Giuseppe, F ; et al.
SEA 2021 - 19th International Symposium on Experimental Algorithms. :1-19

Nice, France Split Components Graph Algorithms phrases 2-Connectivity [INFO]Computer Science [...
Konferenz
Zu den Favoriten
206

LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding *
Bhowmick, Ayan, Kumar ; Meneni, Koushik ; Danisch, Maximilien ; et al.
13th ACM International WSDM Conference. :43-51

Houston, Texas, United S... CCS CONCEPTS • Computing... • Mathematics of computi... scalability real-world graph algorit... [INFO]Computer Science [... …
Konferenz
Zu den Favoriten
207

Lower Bounds for Maximal Matchings and Maximal Independent Sets.
BALLIU, ALKIDA ; BRANDT, SEBASTIAN ; HIRVONEN, JUHO ; et al.
Journal of the ACM. Sep2021, Vol. 68 Issue 5, p1-30. 30p.

DISTRIBUTED computing INDEPENDENT sets GRAPH algorithms OPEN-ended questions
Fachzeitschrift
Zu den Favoriten
208

On rank-monotone graph operations and minimal obstruction graphs for the Lovász–Schrijver SDP hierarchy.
Au, Yu Hin ; Tunçel, Levent
Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p1169-1209. 41p.

GRAPH theory SEMIDEFINITE programming GRAPH algorithms POLYTOPES
Fachzeitschrift
Zu den Favoriten
209

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
Dragan, Feodor, F ; Ducoffe, Guillaume ; Guarnera, Heather, M ; et al.
Journal of Computer and System Sciences. 149:103606-103606

Helly Graphs Structural Properties Subquadratic Graph Algor... Eccentricities Radius Diameter …
Zeitschrift
Zu den Favoriten
210

The Complexity of Homomorphism Reconstructibility
Jan Böker ; Louis Härtel ; Nina Runde ; et al.
Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14
41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)

FOS: Computer and inform... Mathematics of computing... Discrete Mathematics (cs... Theory of computation →... graph homomorphism parameterised complexity …
Fachzeitschrift
Zu den Favoriten
211

Searching for variable structural motifs in RNA graphs using simple descriptors
de Amorim, Camille ; Denise, Alain ; BioInformatique - LISN (BioInfo) ; et al.

Bordeaux, France graph algorithms RNA graphs RNA structural motifs RNA tertiary structure [INFO.INFO-BI]Computer S... …
Konferenz
Zu den Favoriten
212

An Invitation to Dynamic Graph Problems: Upper Bounds — II.
Kashyop, Manas Jyoti ; Narayanaswamy, N. S.
Resonance: Journal of Science Education. Sep2022, Vol. 27 Issue 9, p1607-1624. 18p.

Computer science Charts, diagrams, etc. Graph algorithms Independent sets Dynamic models Resonance
Fachzeitschrift
Zu den Favoriten
213

Decreasing minimization on M-convex sets: algorithms and applications.
Frank, András ; Murota, Kazuo
Mathematical Programming. Sep2022, Vol. 195 Issue 1/2, p1027-1068. 42p.

RESOURCE allocation GRAPH algorithms NONCONVEX programming POLYNOMIALS
Fachzeitschrift
Zu den Favoriten
214

Event‐based Dynamic Graph Drawing without the Agonizing Pain.
Arleo, A. ; Miksch, S. ; Archambault, D.
Computer Graphics Forum. Sep2022, Vol. 41 Issue 6, p226-244. 19p. 5 Diagrams, 8 Charts.

TIME-varying networks GRAPH algorithms INFORMATION disseminatio...
Fachzeitschrift
Zu den Favoriten
215

DAMGNN: Deep adaptive multi-channel graph neural networks.
Li, Yuqiang ; Chen, Wei ; Liao, Jing ; et al.
Intelligent Data Analysis. 2022, Vol. 26 Issue 4, p873-891. 19p.

GRAPH algorithms DEEP learning ATRIOVENTRICULAR node
Fachzeitschrift
Zu den Favoriten
216

Maximum-utility Popular Matchings with Bounded Instability: Maximum-utility popular matchings with bounded instability
Ildikó Schlotter ; Ágnes Cseh
ACM Transactions on Computation Theory. 17:1-35

FOS: Computer and inform... Matching models Discrete Mathematics (cs... stable matching 0211 other engineering a... Parameterized complexity... …
Fachzeitschrift
Zu den Favoriten
217

Fuzzy node rupture degree of some fuzzy graph families
Ferhan Nihan Murater ; Goksen Bacak-Turan
RAIRO - Operations Research. 59:985-998

Connectivity Vertex subsets with spec... Graph algorithms (graph-... vulnerability Density (toughness, etc.... rupture degree …
Fachzeitschrift
Zu den Favoriten
218

Computing Hamiltonian Paths with Partial Order Restrictions: Computing Hamiltonian paths with partial order restrictions
Jesse Beisegel ; Fabienne Ratajczak ; Robert Scheffler
ACM Transactions on Computation Theory. 17:1-24

FOS: Computer and inform... Eulerian and Hamiltonian... Discrete Mathematics (cs... Parameterized complexity... Computational Complexity... outerplanar graph …
Fachzeitschrift
Zu den Favoriten
219

Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs
Giuseppe Ambrosio ; Raffaele Cerulli ; Domenico Serra ; et al.
Networks. 85:351-367

cluster deletion problem cluster graph combinatorial optimizati... edge modification proble... graph algorithms heuristics
Fachzeitschrift
Zu den Favoriten
220

Forbidden Tournaments and the Orientation Completion Problem: Forbidden tournaments and the orientation completion problem
Bodirsky, Manuel ; Guzmán-Pro, Santiago
SIAM Journal on Discrete Mathematics

infinite graphs FOS: Computer and inform... computational complexity Applications of model th... Directed graphs (digraph... Mathematics - Logic …
Fachzeitschrift
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter