Space-Efficient Euler Partition and Bipartite Edge Coloring
DOI10.1007/978-3-319-57586-5_27zbMATH Open1407.68360OpenAlexW2606114807MaRDI QIDQ5283378FDOQ5283378
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
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
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)
Cites Work
- Succinct representation of balanced parentheses and static trees
- The NP-Completeness of Edge-Coloring
- Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
- On Edge Coloring Bipartite Graphs
- Bipartite Edge Coloring in $O(\Delta m)$ Time
- A simple optimal representation for balanced parentheses
- Near-optimal fully-dynamic graph connectivity
- A simple algorithm for edge-coloring bipartite multigraphs
- Deterministic coin tossing with applications to optimal parallel list ranking
- Using euler partitions to edge color bipartite multigraphs
- Space-efficient basic graph algorithms
- A simple matching algorithm for regular bipartite graphs.
Cited In (6)
- On-the-fly array initialization in less space
- Space-efficient Euler partition and bipartite edge coloring
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
- Title not available (Why is that?)
- Towards a theoretical foundation for morphological computation with compliant bodies
- Space-efficient biconnected components and recognition of outerplanar graphs
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)
