Pages that link to "Item:Q1178710"
From MaRDI portal
The following pages link to Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710):
Displaying 31 items.
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
- On the most imbalanced orientation of a graph (Q721946) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Adjacency queries in dynamic sparse graphs (Q846004) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Combinatorial modulus and type of graphs (Q1032918) (← links)
- Arboricity and bipartite subgraph listing algorithms (Q1334644) (← links)
- A connection between sports and matroids: how many teams can we beat? (Q1702129) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- Two-dimensional viscous flow computations on the Connection Machine: Unstructured meshes, upwind schemes and massively parallel computations (Q1802834) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- Navigating planar topologies in near-optimal space and time (Q2096370) (← links)
- On the (near) optimality of extended formulations for multi-way cut in social networks (Q2129209) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs (Q2357161) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- Minimize the maximum duty in multi-interface networks (Q2429355) (← links)
- Asymmetric marking games on line graphs (Q2477402) (← links)
- On a vertex-edge marking game on graphs (Q2660140) (← links)
- Bounded outdegree and extremal length on discrete Riemann surfaces (Q2997806) (← links)
- Min-Max Coverage in Multi-interface Networks (Q3075516) (← links)
- On the Most Imbalanced Orientation of a Graph (Q3196369) (← links)
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE (Q3434271) (← links)
- Straight-Line Drawability of a Planar Graph Plus an Edge (Q3449828) (← links)
- Simultaneously load balancing for every p-norm, with reassignments (Q4638106) (← links)
- Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? (Q4985805) (← links)
- (Q5116488) (← links)
- Graph Orientation with Edge Modifications (Q5859684) (← links)
- Graph orientation with splits (Q5918973) (← links)
- Degree-constrained orientations of embedded graphs (Q5963649) (← links)
