scientific article; zbMATH DE number 2185626

Cited in

(32)

Fast 3-coloring triangle-free planar graphs
A simple greedy algorithm for dynamic graph orientation
Upper and lower degree-constrained graph orientation with minimum penalty
Computing the flip distance between triangulations
Reachability preserving compression for dynamic graph
Single-pass streaming algorithms to partition graphs into few forests
Trade-offs in dynamic coloring for bipartite and general graphs
Orienting dynamic graphs, with applications to maximal matchings and adjacency queries
A constructive arboricity approximation scheme
Simultaneously load balancing for every p-norm, with reassignments
Fully dynamic MIS in uniformly sparse graphs
Improved dynamic graph coloring
Contracting a planar graph efficiently
A simple greedy algorithm for dynamic graph orientation
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
scientific article; zbMATH DE number 7053305 (Why is no real title available?)
Graph orientation with edge modifications
Fully dynamic arboricity maintenance
Graph orientation with splits
Implicit representation of relations
Improved dynamic colouring of sparse graphs
Distributed dense subgraph detection and low outdegree orientation
Sparsity-parameterised dynamic edge colouring
Succinct planar encoding with minor operations
Fully-dynamic load balancing
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
Fully-dynamic load balancing
Locally computing edge orientations
Tree-packing revisited: faster fully dynamic min-cut and arboricity
Local density and its distributed approximation
From theory to practice: engineering approximation algorithms for dynamic orientation
Adjacency queries in dynamic sparse graphs

This page was built for publication:

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