„graph algorithms“

Suchergebnisse

3.156 Treffer

• PACE Solver Description: HitS&DoSeS - Exact and Heuristic Solvers for the Dominating Set and Hitting Set Problems
  Swat, Sylwester 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• TRAMbio: a flexible python package for graph rigidity analysis of macromolecules
  Handke, Nicolas ; Gatter, Thomas ; Reinhardt, Franziska ; Stadler, Peter F.
• A compact data structure and parallel algorithms for permutation graphs
  Gustedt, Jens ; Morvan, Michel ; Viennot, Laurent 1995 TU, Fachbereich 3
• Dynamic 3D Imaging – DAGM 2009 Workshop, Dyn3D 2009, Jena, Germany, September 9, 2009, Proceedings
  Kolb, Andreas 2009 Springer Berlin
• A novel approach for autocorrelation-based classification of environmental audio signals using recurrent network and metaheuristic algorithms
  Er, Mehmet Bilal ; İlhan, Nagehan ; Guner, Kemal ; Kuran, Umut
• Detection and classification of foreign object debris (FOD) with comparative deep learning algorithms in airport runways
  Kucuk, Necip Sahamettin ; Aygun, Hakan ; Dursun, Omer Osman ; Toraman, Suat
• MDG-DDI: multi-feature drug graph for drug-drug interaction prediction
  Li, Wenjun ; Zhou, Yiting ; Ma, Wanjun ; Liang, Weijun ; Tang, Xiwei
• On Maximum 2-Clubs
  Dumont, Joanne ; Lampis, Michael ; Liedloff, Mathieu ; Perez, Anthony ; Todinca, Ioan 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Unveiling molecular moieties through hierarchical Grad-CAM graph explainability
  Contino, Salvatore ; Sortino, Paolo ; Gulotta, Maria Rita ; Perricone, Ugo ; Pirrone, Roberto
• Computational geometry – algorithms and applications
  Berg, Mark Theodoor ˜deœ 2008 Springer
• An algebraic treatment of graph and sorting algorithms
  Russling, Martin 1995 Inst. für Mathematik
• Average case analysis of dynamic graph algorithms
  Alberts, David ; Henzinger, Monika 1995 Freie Univ., Fachbereich Mathematik
• Fast algorithms for 3D-graphics
  1995 Springer
• Fast algorithms for 3D-graphics
  1995 Springer
• Schnelle Algorithmen zur Berechnung der 2-D-Delaunay-Triangulierung – = (Fast algorithms for constructing the 2D Delaunay triangulation)
  Klein, Reinhard ; Krämer, Jörg 1995 WSI
• A comparison of graph-based word sense induction clustering algorithms in a pseudoword evaluation framework
  Cecchini, Flavio Massimiliano ; Riedl, Martin ; Fersini, Elisabetta ; Biemann, Chris
• Parallel algorithms for the construction of special subgraphs
  Moussa, Mahmoud Ibrahim
• Engineering shortest paths and layout algorithms for large graphs
  Willhalm, Thomas
• Knowledge discovery assistants for crash simulations with graph algorithms and energy absorption features
  Pakiman, Anahita ; Garcke, Jochen ; Schumacher, Axel 2022 Universitäts- und Landesbibliothek Bonn
• Visualization Tools for 2D and 3D Finite Element Programs - User's Manual
  Pester, Matthias 2006 Universitätsbibliothek Chemnitz