Parcourir par

  • Revues
  • Séminaires
  • Livres
  • Congrès
  • Sources

Geodesic


    Parcourir par

    • Revues
    • Séminaires
    • Livres
    • Congrès
    • Sources
Discrete mathematics & theoretical computer science
Tome 14 (2012)
no. 1
Précédent Suivant

Volume 14 (2012) no. 1

Sommaire


A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
Gaspers, Serge ; Liedloff, Mathieu

The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words
Kufleitner, Manfred ; Lauser, Alexander

Monadic Second-Order Classes of Forests with a Monadic Second-Order 0-1 Law
Bell, Jason P. ; Burris, Stanley N. ; Yeats, Karen A.

Bounds for the minimum oriented diameter
Kurz, Sascha ; Laetsch, Martin

A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph
Lonc, Zbigniew ; Naroski, Pawel

alpha-Labelings and the Structure of Trees with Nonzero alpha-Deficit
Brinkmann, Gunnar ; Crevals, Simon ; Melot, Hadrien ; Rylands, Leanne ; Steffen, Eckhard

Vertex-colouring edge-weightings with two edge weights
Khatirinejad, Mahdad ; Naserasr, Reza ; Newman, Mike ; Seamone, Ben ; Stevens, Brett

On hamiltonian chain saturated uniform hypergraphs
Dudek, Aneta ; Zak, Andrzej

The generalized 3-connectivity of Cartesian product graphs
Li, Hengzhe ; Li, Xueliang ; Sun, Yuefang

Optimal Computer Crash Performance Precaution
Laksman, Efraim ; Lennerstad, Hakan ; Lundberg, Lars

Adaptive Identification of Sets of Vertices in Graphs
Junnila, Ville
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité