scientific article

zbMath1063.68571MaRDI QIDQ3024792

Gerth Stølting Brodal, Rolf Fagerberg

Publication date: 4 July 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (23)

Simultaneously load balancing for every p-norm, with reassignments ⋮ Adjacency queries in dynamic sparse graphs ⋮ Reachability preserving compression for dynamic graph ⋮ Computing the flip distance between triangulations ⋮ Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries ⋮ On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition ⋮ Implicit representation of relations ⋮ Single-pass streaming algorithms to partition graphs into few forests ⋮ Trade-offs in dynamic coloring for bipartite and general graphs ⋮ Fast 3-coloring triangle-free planar graphs ⋮ A Constructive Arboricity Approximation Scheme ⋮ Fully dynamic MIS in uniformly sparse graphs ⋮ A simple greedy algorithm for dynamic graph orientation ⋮ Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree ⋮ Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree ⋮ Graph orientation with splits ⋮ Fully dynamic arboricity maintenance ⋮ Upper and lower degree-constrained graph orientation with minimum penalty ⋮ Unnamed Item ⋮ Contracting a Planar Graph Efficiently ⋮ Improved Dynamic Graph Coloring ⋮ Graph Orientation with Edge Modifications ⋮ Unnamed Item

This page was built for publication: