Pages that link to "Item:Q5317201"

The following pages link to Approximating the Minimum Spanning Tree Weight in Sublinear Time (Q5317201):

Displaying 36 items.

• Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
• The saga of minimum spanning trees (Q458468) (← links)
• A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)
• Testing outerplanarity of bounded degree graphs (Q494925) (← links)
• Separating sublinear time computations by approximate diameter (Q849140) (← links)
• Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573) (← links)
• Unique entity estimation with application to the Syrian conflict (Q1624822) (← links)
• Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
• Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
• Constant-time dynamic weight approximation for minimum spanning forest (Q2051831) (← links)
• Estimating the number of connected components in a graph via subgraph sampling (Q2174974) (← links)
• Estimating the number of connected components in sublinear time (Q2252647) (← links)
• Local algorithms for sparse spanning graphs (Q2300722) (← links)
• Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
• Constructing near spanning trees with few local inspections (Q2977565) (← links)
• Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time (Q3575153) (← links)
• Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs (Q3642863) (← links)
• (Q3741632) (← links)
• New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen (Q4210146) (← links)
• Approximately Counting Triangles in Sublinear Time (Q4593251) (← links)
• Sublinear-time Algorithms (Q4933363) (← links)
• Sublinear Graph Approximation Algorithms (Q4933367) (← links)
• Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) (← links)
• On the probe complexity of local computation algorithms (Q5002725) (← links)
• A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
• Quantum Chebyshev's Inequality and Applications (Q5091227) (← links)
• Seeding with Costly Network Information (Q5106371) (← links)
• On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) (← links)
• Separating Sublinear Time Computations by Approximate Diameter (Q5505645) (← links)
• Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time (Q5700570) (← links)
• Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds (Q5700572) (← links)
• (Q5743413) (← links)
• (Q5743463) (← links)
• Minimum-weight spanning tree algorithms. A survey and empirical study (Q5953166) (← links)
• Sublinear time approximation of the cost of a metric \(k\)-nearest neighbor graph (Q6491305) (← links)
• Testing connectedness of images (Q6623596) (← links)