Hochschulschrift
Vertex isoperimetric numbers and local search in deBruijn networks
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
55 Bl.
- Sprache
-
Englisch
- Anmerkungen
-
Bielefeld, Univ., Diss., 1997
- Schlagwort
-
Endlicher Graph
Ungerichteter Graph
Isoperimetrische Ungleichung
- Urheber
-
Bültermann, Jörg
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:06 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Bültermann, Jörg
Ähnliche Objekte (12)
Structural similarity of vertices in networks
Vertex
Dynamic vertex colored conflict graphs for time-sensitive networks
Generalized vertex algebras and relative vertex operators
Interaction between numbers and size during visual search
Vertex Vega
Vertex, Wien
Vertex, Wien
On local optimality of vertex type designs in generalized linear models
On local optimality of vertex type designs in generalized linear models
Optimizing fuel consumption on inland waterway networks : local search heuristic for lock scheduling
Local search in memetic algorithms : the Impact of the Local Search Frequency
Structural similarity of vertices in networks
Vertex
Dynamic vertex colored conflict graphs for time-sensitive networks
Generalized vertex algebras and relative vertex operators
Interaction between numbers and size during visual search
Vertex Vega
Vertex, Wien
Vertex, Wien
On local optimality of vertex type designs in generalized linear models
On local optimality of vertex type designs in generalized linear models
Optimizing fuel consumption on inland waterway networks : local search heuristic for lock scheduling
Local search in memetic algorithms : the Impact of the Local Search Frequency
Structural similarity of vertices in networks
Vertex
Dynamic vertex colored conflict graphs for time-sensitive networks
Generalized vertex algebras and relative vertex operators
Interaction between numbers and size during visual search
Vertex Vega
Vertex, Wien
Vertex, Wien
On local optimality of vertex type designs in generalized linear models
On local optimality of vertex type designs in generalized linear models
Optimizing fuel consumption on inland waterway networks : local search heuristic for lock scheduling