„Graphs“

Suchergebnisse

10.000+ Treffer

• Low-degree spanning trees of 2-edge-connected graphs in linear time
  Dereniowski, Dariusz ; Dybizbański, Janusz ; Karpiński, Przemysław ; Zakrzewski, Michał ; Żyliński, Paweł
• Explore brain-inspired machine intelligence for connecting dots on graphs through holographic blueprint of oscillatory synchronization
  Dan, Tingting ; Ding, Jiaqi ; Wu, Guorong
• Correction: Spectral polynomials, graph descriptors, spectra, and entropies of cage graphs
  Balasubramanian, Krishnan
• Spectral polynomials, graph descriptors, spectra, and entropies of cage graphs
  Balasubramanian, Krishnan
• Analysis of factors influencing polycystic ovary syndrome in women of reproductive age based on directed acyclic graphs
  Yu, Huixi ; Guo, Yu ; Ling, Yingni ; Su, Yinhua ; Li, Zhongyu
• On the Gaussian Curvature of Graphs of Holomorphic Functions
  Cruz-López, Manuel ; Romero, Otto
• Independent sets in graphs with triangles
  Hofmeister, Thomas ; Lefmann, Hanno 1995 Dekanat Informatik, Univ.
• Prosodic scoring of word hypotheses graphs
  Kompe, Ralf 1995 DFKI
• On embedding 2 dimensional toroidal grids into de Bruijn graphs with clocked congestion one
  Andreae, Thomas 1995 Univ., Math. Seminar
• Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three
  Andreae, Thomas 1995 Univ., Math. Seminar
• Ladders in de Bruijn graphs
  Hintz, Martin 1995 Univ., Math. Seminar
• Embedding graphs with bounded treewidth into optimal hypercubes
  Heun, Volker ; Mayr, Ernst W. 1995 SFB 342
• Implementing the change of data structures with SPECTRUM in the framework of KORSO development graphs
  Slotosch, Oscar 1995 Inst. für Informatik
• Regular two-graphs from the even unimodular lattice E8 ⊕ E8
  Grišuchin, V. P. 1995 Sonderforschungsbereich 343
• Acyclic and oriented chromatic numbers of graphs
  Kostočka, Aleksandr V. ; Sopena, Eric ; Zhu, Xuding 1995 Sonderforschungsbereich 343
• The chromatic numbers of distance graphs
  Deuber, Walter A. ; Zhu, Xuding 1995 Sonderforschungsbereich 343
• Efficient union find for planar graphs and other sparse graph classes – (extended abstracts)
  Gustedt, Jens 1995 TU, Fachbereich 3
• A compact data structure and parallel algorithms for permutation graphs
  Gustedt, Jens ; Morvan, Michel ; Viennot, Laurent 1995 TU, Fachbereich 3
• A polynomial time algorithm for computation of the Tutte polynomials of graphs of bounded treewidth
  Andrzejak, Artur 1995 Freie Univ., Fachbereich Mathematik
• Universal 3-dimensonal visibility representations for graphs
  Alt, Helmut ; Godau, Michael ; Whitesides, Sue 1995 Freie Univ., Fachbereich Mathematik