Pages that link to "Item:Q1062461"

The following pages link to A linear-time algorithm for a special case of disjoint set union (Q1062461):

Displaying 50 items.

• Modular decomposition and transitive orientation (Q1301738) (← links)
• A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works (Q1304467) (← links)
• A linear time algorithm for unique Horn satisfiability (Q1313762) (← links)
• A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm (Q1323480) (← links)
• Minimizing the weighted number of tardy task units (Q1329790) (← links)
• A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals (Q1332777) (← links)
• A linear-time construction of the relative neighborhood graph from the Delaunay triangulation (Q1334610) (← links)
• A constant update time finger search tree (Q1338781) (← links)
• Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits (Q1350298) (← links)
• Parallel maximum independent set in convex bipartite graphs (Q1350905) (← links)
• A note on finding compact sets in graphs represented by an adjacency list (Q1351637) (← links)
• Planar stage graphs: Characterizations and applications (Q1392202) (← links)
• Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. (Q1417580) (← links)
• The maximum deviation just-in-time scheduling problem. (Q1421459) (← links)
• Recognizing quasi-triangulated graphs. (Q1428566) (← links)
• Algorithms for separable convex optimization with linear ascending constraints (Q1628287) (← links)
• 2-vertex connectivity in directed graphs (Q1640998) (← links)
• Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
• Efficient algorithms for shortest partial seeds in words (Q1698721) (← links)
• Mobile versus point guards (Q1716007) (← links)
• Edge-orders (Q1741850) (← links)
• Simultaneous embedding: edge orderings, relative positions, cutvertices (Q1751092) (← links)
• Single backup table schemes for shortest-path routing (Q1770371) (← links)
• Alignment-free sequence comparison using absent words (Q1784946) (← links)
• Topologically sweeping visibility complexes via pseudotriangulations (Q1816465) (← links)
• Intersection reporting on two collections of disjoint sets (Q1818976) (← links)
• A linear-time algorithm for edge-disjoint paths in planar graphs (Q1842575) (← links)
• An optimal algorithm for reporting visible rectangles (Q1847392) (← links)
• Dynamic nested brackets (Q1882928) (← links)
• On the \(k\)-coloring of intervals (Q1893157) (← links)
• Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (Q1900895) (← links)
• Power domination in circular-arc graphs (Q1939660) (← links)
• Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays (Q1975378) (← links)
• Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
• Range minimum queries in minimal space (Q2078612) (← links)
• Foremost non-stop journey arrival in linear time (Q2097355) (← links)
• Safety in \(s\)-\(t\) paths, trails and walks (Q2118205) (← links)
• A data structure for substring-substring LCS length queries (Q2118872) (← links)
• A formal model for a linear time correctness condition of proof nets of multiplicative linear logic (Q2119124) (← links)
• Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← links)
• A MinCumulative resource constraint (Q2170208) (← links)
• An SPQR-tree-like embedding representation for upward planarity (Q2206883) (← links)
• The power of linear-time data reduction for maximum matching (Q2211355) (← links)
• A simplified algorithm computing all \(s-t\) bridges and articulation points (Q2235263) (← links)
• Finding the gapped longest common subsequence by incremental suffix maximum queries (Q2252523) (← links)
• Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs (Q2283031) (← links)
• On the König deficiency of zero-reducible graphs (Q2292142) (← links)
• Planarity of streamed graphs (Q2333805) (← links)
• Computing maximum non-crossing matching in convex bipartite graphs (Q2348053) (← links)