Pages that link to "Item:Q4459604"

The following pages link to Complexity of approximating the oriented diameter of chordal graphs (Q4459604):

Displaying 22 items.

• Improved bound on the oriented diameter of graphs with given minimum degree (Q326665) (← links)
• The complexity of two graph orientation problems (Q412352) (← links)
• Series-parallel orientations preserving the cycle-radius (Q413267) (← links)
• Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
• On the most imbalanced orientation of a graph (Q721946) (← links)
• A degree condition for diameter two orientability of graphs (Q1727780) (← links)
• AT-free graphs: Linear bounds for the oriented diameter (Q1827858) (← links)
• An improvement to Chvátal and Thomassen's upper bound for oriented diameter (Q2231791) (← links)
• Diameter of orientations of graphs with given minimum degree (Q2349963) (← links)
• A faster diameter problem algorithm for a chordal graph, with a connection to its center problem (Q2659238) (← links)
• The complexity of deciding whether a graph admits an orientation with fixed weak diameter (Q2808534) (← links)
• Directing Road Networks by Listing Strong Orientations (Q2819493) (← links)
• Minimizing the oriented diameter of a planar graph (Q2851475) (← links)
• On the Most Imbalanced Orientation of a Graph (Q3196369) (← links)
• GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE (Q3434271) (← links)
• (Q4414499) (← links)
• An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter (Q5042233) (← links)
• Oriented diameter of star graphs (Q5896108) (← links)
• Improved bounds for the oriented radius of mixed multigraphs (Q6047957) (← links)
• The oriented diameter of graphs with given connected domination number and distance domination number (Q6154372) (← links)
• Large girth and small oriented diameter graphs (Q6197710) (← links)
• On oriented diameter of \((n, k)\)-star graphs (Q6558685) (← links)