A note on models for graph representations
From MaRDI portal
Recommendations
Cites work
- A note on models for graph representations
- Coding the vertexes of a graph
- Compact Forbidden-Set Routing
- Compact Labeling Scheme for Ancestor Queries
- Compact oracles for reachability and approximate distances in planar digraphs
- D2B: A de Bruijn based content-addressable network
- Distance labeling in graphs
- Distributed verification of minimum spanning trees
- General compact labeling schemes for dynamic trees
- scientific article; zbMATH DE number 2080510 (Why is no real title available?)
- scientific article; zbMATH DE number 1756017 (Why is no real title available?)
- scientific article; zbMATH DE number 1759444 (Why is no real title available?)
- scientific article; zbMATH DE number 2086374 (Why is no real title available?)
- scientific article; zbMATH DE number 1420896 (Why is no real title available?)
- Implicat Representation of Graphs
- Interval Routing
- Labeling schemes for dynamic tree networks
- Labeling Schemes for Flow and Connectivity
- Labeling Schemes for Vertex Connectivity
- Labeling schemes for weighted dynamic trees
- Labelling and Implicit Routing in Networks
- Nearest common ancestors: a survey and a new algorithm for a distributed environment
- New models and algorithms for future networks
- Resource discovery in distributed networks
- Routing with Improved Communication-Space Trade-Off
Cited in
(6)- A note on models for graph representations
- A note on vector representation of graphs
- Remarks on Laplacian of graphical models in various graphs
- Easiness in graph models
- scientific article; zbMATH DE number 6456807 (Why is no real title available?)
- The tree structure of graphs for various graphical models
This page was built for publication: A note on models for graph representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008739)