„Graph problems“

Suchergebnisse

867 Treffer

• Boundary value problems on planar graphs and flat surfaces with integer cone singularities, I: The Dirichlet problem
  Hersonsky, Sa'ar
• Paralel Predictor-Corrector Schemes for Parabolic Problems on Graphs
  Čiegis, R. ; Tumanova, N.
• Performance evaluation of anti-predatory nature-inspired algorithm for small scale to very high scale problems
  Sachan, Rohit Kumar ; Mallick, Shrabani ; Verma, Abhishek Singh
• Graph optimization problems in connection with the management of mobile communications systems
  Dahl, G. ; Jörnsten, K. ; Løvnes, G. ; Svaet, S.
• Improved Approximation Algorithms for Maximum Graph Partitioning Problems
  Jäger, Gerold ; Srivastav, Anand
• Domination problems on special graph classes
  Szymczak, Thomas
• Approximation algorithms for layout problems
  Wirtgen, Jürgen
• Fast randomized and parallel algorithms for cycle problems on graphs
  Dorgerloh, Carsten F.
• Selected open problems in continuous-time quantum walks
  Coutinho, Gabriel ; Guo, Krystal
• On the existence of triangulated spheres in 3-graphs, and related problems
  Sós, V. T. ; Erdős, P. ; Brown, W. G.
• Node and edge averaged complexities of local graph problems
  Balliu, Alkida ; Ghaffari, Mohsen ; Kuhn, Fabian ; Olivetti, Dennis 2024 Universität
• Efficient reduction for path problems on circular-arc graphs
  Arikati, Srinivasa R. ; Pandu Rangan, C. ; Manacher, Glenn K.
• Arc graphs and their possible application to sparse matrix problems
  Rheinboldt, Werner C. ; Mesztenyi, Charles K.
• Probleme der Modellierung und Simulation – [vom 9. - 11. Dez. 1987 in Leipzig]
  Kutschke, Karl-Heinz 1988 Wilhelm-Pieck-Univ., Abt. Wissenschaftspublizistik
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
  Arnborg, Stefan
• Visibility problems for orthogonal objects in two-or three-dimensions
  Doh, Jeong-In ; Chwa, Kyung-Yong
• Algorithms and Methods for Solving Scheduling Problems and Other Extremum Problems on Large-Scale Graphs
  Pankratiev, E. V. ; Chepovskiy, A. M. ; Cherepanov, E. A. ; Chernyshev, S. V.
• Clustering methods for geometric objects and applications to design problems
  Dehne, F. ; Noltemeier, H.
• Node and edge averaged complexities of local graph problems
  Balliu, Alkida ; Ghaffari, Mohsen ; Kuhn, Fabian ; Olivetti, Dennis
• Parallel algorithms for shortest path problems in polygons
  ElGindy, Hossam ; Goodrich, Michael