„Graph algorithms“

Suchergebnisse

3.156 Treffer

• Graph powers: hardness results, good characterizations and efficient algorithms
  Nguyen, Ngoc Tuy
• Orthogonal graph drawing with constraints – algorithms and applications
  Siebenhaller, Martin
• Algorithms for streaming graphs
  Zelke, Mariano
• Acceleration of medical imaging algorithms using programmable graphics hardware
  Schiwietz, Thomas
• A New Execution Model and Executor for Adaptively Optimizing the Performance of Parallel Algorithms Using HPX Runtime System
  Mohammadiporshokooh, Karame ; Brandt, Steven R. ; Kaiser, Hartmut
• Algorithms and computation – third international workshop ; proceedings
  Das, Sandip 2009 Springer
• Algorithms and experiments for parameterized approaches to hard graph problems
  Hüffner, Falk
• Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-Offs and Algorithms
  Roditty, Liam ; Sapir, Ariel 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding Small Dijoins in Transitive Closure Time
  Nalam, Chaitanya ; Saranurak, Thatchaphol 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Upper Bounds on Multiflow-Multicut Gaps in Cactus Graphs
  Kalantarzadeh, Sina ; Kumar, Nikhil 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parallel Complexity of Depth-First-Search and Maximal Path in Restricted Graph Classes
  Chauhan, Archit ; Datta, Samir ; Praveen, M. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
  Chang, Yi-Jun ; Chen, Yanyu ; Mishra, Gopinath 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized approximation algorithms for optimization problems on graphs
  Kaul, Matthias ; Mnich, Matthias ; Shachnai, Hadas ; Spoerhase, Joachim 2025 Technische Universität Hamburg. Universitätsbibliothek
• Efficient algorithms for robust pattern mining on structured objects with applications to structure-based drug design
  Weskamp, Nils
• The domatic number problem: Boolean hierarchy completeness and exact exponential time algorithms
  Riege, Tobias
• Polyhedra and algorithms for the general routing problem
  Theis, Dirk
• Exact algorithms for NP hard problems on networks – design, analysis and implementation
  Alber, Jochen
• Algorithms for the Steiner problem in networks
  Polzin, Tobias
• Geometric algorithms for object placement and planarity in a terrain
  Ray, Rahul
• Approximation and online algorithms in scheduling and coloring
  Fishkin, Aleksei V.