4 Einträge gefunden

1. Certifying 3-edge-connectivity

   1. Mehlhorn, Kurt
   2. Neumann, Adrian
   3. Schmidt, Jens M.

   2017 - TUHH Open Research
2. Certifying 3-edge-connectivity

   1. Mehlhorn, Kurt
   2. Neumann, Adrian
   3. Schmidt, Jens M.

   2013 - TUHH Open Research
3. Every DFS tree of a 3-connected graph contains a contractible edge

   1. Elmasry, Amr
   2. Mehlhorn, Kurt
   3. Schmidt, Jens M.

   2013 - TUHH Open Research
4. An O(n+ m) certifying triconnnectivity algorithm for Hamiltonian graphs

   1. Elmasry, Amr
   2. Mehlhorn, Kurt
   3. Schmidt, Jens M.

   2010 - TUHH Open Research