Pages that link to "Item:Q4540051"

The following pages link to Solving the all-pair shortest path query problem on interval and circular-arc graphs (Q4540051):

Displaying 22 items.

• Algorithms for interval structures with applications (Q388095) (← links)
• Backup 2-center on interval graphs (Q442280) (← links)
• Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
• The \(p\)-Maxian problem on interval graphs (Q608284) (← links)
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
• \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs (Q868392) (← links)
• An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths (Q868984) (← links)
• Localized and compact data-structure for comparability graphs (Q1025540) (← links)
• Unified all-pairs shortest path algorithms in the chordal hierarchy (Q1364781) (← links)
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (Q1900895) (← links)
• Disconnected cuts in claw-free graphs (Q2186821) (← links)
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
• Succinct encodings for families of interval graphs (Q2661990) (← links)
• Algorithms for Interval Structures with Applications (Q3004669) (← links)
• Distance Labeling for Permutation Graphs (Q3439382) (← links)
• Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621) (← links)
• (Q4887753) (← links)
• (Q5009627) (← links)
• Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)
• O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS (Q5249020) (← links)
• Parameterized complexity of diameter (Q5925618) (← links)
• Distance queries over dynamic interval graphs (Q6577442) (← links)