- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Iterators and Handles for Nodes and Edges in Graphs ; 15
Konstanzer Schriften in Mathematik und Informatik ; 15
- Classification
-
Informatik
- Creator
-
Kühl, Dietmar
Weihe, Karsten
- URN
-
urn:nbn:de:bsz:352-opus-20060
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:50 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kühl, Dietmar
- Weihe, Karsten
Other Objects (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