Pages that link to "Item:Q1115629"

The following pages link to An efficient algorithm for maxdominance, with applications (Q1115629):

Displaying 19 items.

• A new approach for the domination problem on permutation graphs (Q750166) (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• Finding a minimum independent dominating set in a permutation graph (Q1117255) (← links)
• An algorithm for the determination of longest increasing subsequence in a sequence (Q1119638) (← links)
• Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs (Q1183585) (← links)
• Efficient algorithms for the largest rectangle problem (Q1193696) (← links)
• Maximum \(k\)-covering of weighted transitive graphs with applications (Q1207331) (← links)
• Circular permutation graph family with applications (Q1208459) (← links)
• Drawing graphs in two layers (Q1331939) (← links)
• On the feedback vertex set problem in permutation graphs (Q1338778) (← links)
• An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
• On the largest empty axis-parallel box amidst \(n\) points (Q1950392) (← links)
• Improved bottleneck domination algorithms (Q2499580) (← links)
• Fully dynamic algorithms for permutation graph coloring (Q3123352) (← links)
• Fast sequential and parallel algorithms for finding the largest rectangle separating two sets (Q3210919) (← links)
• SKEW VORONOI DIAGRAMS (Q4949988) (← links)
• Maximal Empty Boxes Amidst Random Points (Q5891110) (← links)
• An efficient algorithm for computing the maximum empty rectangle in three dimensions (Q5938672) (← links)
• Fast parallel algorithms for the maximum empty rectangle problem. (Q5955753) (← links)