„graph algorithms“

Suchergebnisse

3.156 Treffer

• Structural graph theory meets algorithms: covering and connectivity problems in graphs
  Akhoondian Amiri, Saeed ; Kreutzer, Stephan ; Pilipczuk, Marcin ; Thilikos, Dimitrios 2017 Technische Universität Berlin
• Theory and practice of computer science – proceedings
  Emde Boas, Peter ˜vanœ ; Groen, Frans C.A. ; Italiano, Giuseppe F. ; Nawrocki, Jerzy R. ; Sack, Harald 2013 Springer
• An Optimal Decentralized (Δ + 1)-Coloring Algorithm
  Bertschinger, Daniel ; Lengler, Johannes ; Martinsson, Anders ; Meier, Robert ; Steger, Angelika ; Trujić, Miloš ; Welzl, Emo 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact and Approximation Algorithms for Routing a Convoy Through a Graph
  Ee, Martijn ˜vanœ ; Oosterwijk, Tim ; Sitters, René ; Wiese, Andreas 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Planar Stories of Graph Drawings: Algorithms and Experiments
  Binucci, Carla ; Cornelsen, Sabine ; Didimo, Walter ; Hong, Seok-Hee ; Katsanou, Eleni ; Patrignani, Maurizio ; Symvonis, Antonios ; Wolf, Samuel 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Pavlidis, T., Algorithms for Graphics and Image Processing. Berlin‐Heidelberg‐New York, Springer‐Verlag 1982. XVII, 447 S., DM 74, –. US $ 32.90. ISBN 3‐540‐11338‐X
  Völz, H.
• Hoffmann, C. M., Group‐Theoretic Algorithms and Graph Isomorphism. Berlin‐Heidelberg‐New York, Springer‐Verlag 1982. VIII, 311 S., DM 32,80. US $ 14.60. ISBN 3‐540‐11493‐9 (Lecture Notes in Computer Science 136)
  Fischer, Th.
• R. A. Earnshaw (ed.). Fundamental Algorithms for Computer Graphics. Springer‐Verlag Berlin, Heidelberg, New York, Tokyo 1985, 1041 Seiten, DM 198,00, ISBN 3‐540‐13920‐6
  Köhler, H.‐J.
• Approximating Densest Subgraph in Geometric Intersection Graphs
  Har-Peled, Sariel ; Rahul, Saladi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs
  Har-Peled, Sariel ; Yang, Everett 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles
  Chung, Lily ; Demaine, Erik D. ; Hendrickson, Dylan ; Luo, Victor 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Delay-Robust Routes in Temporal Graphs
  Füchsle, Eugen ; Molter, Hendrik ; Niedermeier, Rolf ; Renken, Malte 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Efficient CONGEST Algorithms for the Lovász Local Lemma
  Maus, Yannic ; Uitto, Jara 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Binary Matrix Completion Under Diameter Constraints
  Koana, Tomohiro ; Froese, Vincent ; Niedermeier, Rolf 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping
  Brandt, Sebastian ; Keller, Barbara ; Rybicki, Joel ; Suomela, Jukka ; Uitto, Jara 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact and approximation algorithms for routing a convoy through a graph
  Ee, Martijn ˜vanœ ; Oosterwijk, Tim ; Sitters, René ; Wiese, Andreas
• Power and Speed-Efficient Code Transformation of Video Compression Algorithms for RISC Processors
  Nachtergaele, Lode ; Gijbels, Toon ; Bormans, Jan ; Catthoor, Francky ; Bolsens, Ivo
• Murota, K., Systems Analysis by Graphs and Matroids. Structural Solvability and Controllability. Berlin etc., Springer‐Verlag 1987. IX, 281 pp., 54 figs., DM 79,–. ISBN 3‐540‐17659‐4 (Algorithms and Combinatorics 3)
  Terno, J.
• Nishizeki, T., N. Chiba: Planar Graphs: Theory and Algorithms. (North‐Holland Mathematics Studies, 140); (Annals of Discrete Mathematics, 32). North Holland, Amsterdam 1988, 232 pp., $ 100,‐; Dfl. 190,‐, ISBN 0‐444‐70212‐1
  Seese, D.
• Perfect Forests in Graphs and Their Extensions
  Gutin, Gregory Z. ; Yeo, Anders 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik