The following pages link to (Q3024792):
Displaying 23 items.
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- Adjacency queries in dynamic sparse graphs (Q846004) (← links)
- Fast 3-coloring triangle-free planar graphs (Q1957652) (← links)
- A simple greedy algorithm for dynamic graph orientation (Q1986959) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- Reachability preserving compression for dynamic graph (Q2660982) (← links)
- Single-pass streaming algorithms to partition graphs into few forests (Q2695324) (← links)
- Trade-offs in dynamic coloring for bipartite and general graphs (Q2696273) (← links)
- Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries (Q2942621) (← links)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
- Simultaneously load balancing for every p-norm, with reassignments (Q4638106) (← links)
- Fully dynamic MIS in uniformly sparse graphs (Q5002774) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)
- Contracting a Planar Graph Efficiently (Q5111739) (← links)
- (Q5136228) (← links)
- (Q5743426) (← links)
- Graph Orientation with Edge Modifications (Q5859684) (← links)
- Fully dynamic arboricity maintenance (Q5918831) (← links)
- Graph orientation with splits (Q5918973) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Implicit representation of relations (Q6185606) (← links)
