„Graph algorithms“

Suchergebnisse

3.156 Treffer

• CoSREM: a graph mining algorithm for the discovery of combinatorial splicing regulatory elements
  Badr, Eman ; Heath, Lenwood S.
• Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
  Jeffery, Stacey ; Kothari, Robin ; Le Gall, François ; Magniez, Frédéric
• Space-efficient region filling in raster graphics
  Henrich, Dominik 1994 Technische Universität Kaiserslautern, Fachbereich Informatik
• Solving Multi-Agent Pathfinding Problems on Graphs in Polynomial Time – A deterministic approach to solving multi-agent pathfinding problems on graphs efficiently
  Khorshid, Mokhtar 2012 LAP LAMBERT Academic Publishing
• Parameterized and exact computation – 7th international symposium ; proceedings
  Thilikos, Dimitrios M. ; Woeginger, Gerhard J. 2012 Springer
• AGD-library – a library of algorithms for graph drawing
  Alberts, David 1997 MPI Informatik, Bibliothek & Dokumentation
• Algorithms in bioinformatics – 12th international workshop ; proceedings
  Raphael, Ben ; Tang, Jijun 2012 Springer
• Approximation, randomization, and combinatorial optimization – algorithms and techniques ; proceedings
  Gupta, Anupam ; Jansen, Klaus ; Rolim, José D.P. ; Servedio, Rocco 2012 Springer
• Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
  Kapsalis, A. ; Raywad-Smith, V. J. ; Smith, G. D.
• Approximate Colouring Algorithms for Composite Graphs
  Clementson, A. T. ; Elphick, C. H.
• Optimization Algorithms for Networks and Graphs
  Smith, David K.
• Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity
  Foucaud, Florent ; Mertzios, George B. ; Naserasr, Reza ; Parreau, Aline ; Valicov, Petru
• Graph algorithms and applications – 13.05. - 17.05.96
  Nishizeki, Takao 1996 Geschäftsstelle Schloss Dagstuhl, Univ. des Saarlandes
• Graphs, networks and algorithms
  Jungnickel, Dieter 2013 Springer
• Combinatorial optimization – second international symposium ; revised selected papers
  Mahjoub, Ali Ridha ; Markakis, Vangelis ; Milis, Ioannis ; Paschos, Vangelis Th. 2012 Springer
• Occlusion culling and z-fail for soft shadow volume algorithms
  Assarsson, Ulf ; Akenine-Möller, Tomas
• Mathematics of Program Construction – 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings
  Gibbons, Jeremy ; Nogueira, Pablo 2012 Springer Berlin Heidelberg
• Full and partial Jacobian computation via graph coloring – algorithms and applications
  Lülfesmann, Michael 2012 Cuvillier
• Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation
  Kobayashi, Yusuke ; Toyooka, Sho
• Application of Graph Theory in Operational Research Problems – Basic concepts, Formulation of the problems, Algorithms
  Sharma, Anurag 2012 LAP LAMBERT Academic Publishing