- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Iterators and Handles for Nodes and Edges in Graphs ; 15
Konstanzer Schriften in Mathematik und Informatik ; 15
- Klassifikation
-
Informatik
- Urheber
-
Kühl, Dietmar
Weihe, Karsten
- URN
-
urn:nbn:de:bsz:352-opus-20060
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:50 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.
Beteiligte
- Kühl, Dietmar
- Weihe, Karsten
Ähnliche Objekte (12)
Graph matching with type constraints on nodes and edges
Co-embedding of edges and nodes with deep graph convolutional neural networks
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Identifying influential nodes in complex networks based on Neighbours and edges
Detecting image edges in IOT nodes without FPU
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
Strong Edge Coloring of Cayley Graphs and Some Product Graphs
Time-varying graph learning from smooth and stationary graph signals with hidden nodes
Edges as nodes - A new approach to timetable information
The 2-edge geodetic number and graph operations
Bananas: multi-edge graphs and their Feynman integrals
Balanced edge-labelings in graphs and related concepts
Graph matching with type constraints on nodes and edges
Co-embedding of edges and nodes with deep graph convolutional neural networks
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Identifying influential nodes in complex networks based on Neighbours and edges
Detecting image edges in IOT nodes without FPU
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
Strong Edge Coloring of Cayley Graphs and Some Product Graphs
Time-varying graph learning from smooth and stationary graph signals with hidden nodes
Edges as nodes - A new approach to timetable information
The 2-edge geodetic number and graph operations
Bananas: multi-edge graphs and their Feynman integrals
Balanced edge-labelings in graphs and related concepts
Graph matching with type constraints on nodes and edges
Co-embedding of edges and nodes with deep graph convolutional neural networks
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Identifying influential nodes in complex networks based on Neighbours and edges
Detecting image edges in IOT nodes without FPU
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
Strong Edge Coloring of Cayley Graphs and Some Product Graphs
Time-varying graph learning from smooth and stationary graph signals with hidden nodes
Edges as nodes - A new approach to timetable information
The 2-edge geodetic number and graph operations
Bananas: multi-edge graphs and their Feynman integrals