NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • 1
  • Tagged with
  • 3
  • 3
  • 3
  • 3
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 3 of 3 (0.089 seconds)

Spelling suggestions: "subject:"abschnitt < graphentheorie> "" "subject:"abschnitt < rechentheorie> ""

1

Approximative Lösungen des Max-cut-Problems mit semidefiniten Programmen

Hirschfeld, Bernd. January 2004 (has links)
Düsseldorf, Universiẗat, Diss., 2004.
Schnitt <Graphentheorie>
2

Drawing families of cuts in a graph

Cornelsen, Sabine. January 2003 (has links) (PDF)
Konstanz, University, Diss., 2003.
Schnitt <Graphentheorie>
3

Eine relationale Strategie zur Einteilung von Gruppen auf Basis flüchtiger Kontakte

Dorfmüller, Gabi. January 2005 (has links)
Konstanz, Univ., Diplomarb., 2005.

Page generated in 0.0925 seconds