In this paper the representation of the embedding of a graph on a surface by a pair of permutations is considered. This representation is used to implement efficiently some algorithms for graphs.
Nội dung trích xuất từ tài liệu:
Using combinatorial maps for algorithms on graphs
Using combinatorial maps for algorithms on graphs
Số trang: 16
Loại file: pdf
Dung lượng: 840.91 KB
Lượt xem: 36
Lượt tải: 0
Thông tin tài liệu:
Tìm kiếm theo từ khóa liên quan:
Computer science and cybernetics Graph algorithms Topological embeddings Spanning trees Tutte polynomials Graphs on SurfacesTài liệu có liên quan:
-
Ebook Graph algorithms: Practical examples in Apache Spark and Neo4j - Part 2
131 trang 43 0 0 -
28 trang 40 0 0
-
Revisiting some fuzzy algebraic structures
16 trang 37 0 0 -
Adaptive fast nonsingular terminal sliding mode control for manipulator robot
10 trang 36 0 0 -
The role of annotated logics in AI: A review
14 trang 35 0 0 -
Automatic identification of some Vietnamese folk songs Cheo and Quanho using deep neural networks
21 trang 34 0 0 -
Ebook Introduction to algorithms (3rd edition)
1313 trang 33 0 0 -
313 trang 31 0 0
-
359 trang 31 0 0
-
Joint power cost and latency minimization for secure collaborative learning systems
12 trang 30 0 0
