Space-Efficient Euler Partition and Bipartite Edge Coloring

DOI10.1007/978-3-319-57586-5_27MaRDI QIDQ5283378zbMATH OpenOpenAlexFDO

Authors Torben Hagerup, Frank Kammer, Moritz Laudahn

Publication date 21 July 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-57586-5_27

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A control theory approach to the analysis and synthesis of the experimentally observed motion primitives
• Expert Control for a Robot Body
• Towards a theoretical foundation for morphological computation with compliant bodies
• scientific article; zbMATH DE number 1962029
• MOSAIC model for sensorimotor learning and control

Cites work

• A simple algorithm for edge-coloring bipartite multigraphs
• A simple matching algorithm for regular bipartite graphs.
• A simple optimal representation for balanced parentheses
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• Bipartite Edge Coloring in $O(\Delta m)$ Time
• Deterministic coin tossing with applications to optimal parallel list ranking
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Near-optimal fully-dynamic graph connectivity
• On Edge Coloring Bipartite Graphs
• Space-efficient basic graph algorithms
• Succinct representation of balanced parentheses and static trees
• The NP-Completeness of Edge-Coloring
• Using euler partitions to edge color bipartite multigraphs

Cited in

(6)

• Towards a theoretical foundation for morphological computation with compliant bodies
• Space-efficient Euler partition and bipartite edge coloring
• scientific article; zbMATH DE number 6469209 (Why is no real title available?)
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Space-efficient biconnected components and recognition of outerplanar graphs
• On-the-fly array initialization in less space

This page was built for publication: Space-Efficient Euler Partition and Bipartite Edge Coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283378)