Searching for "All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time." – sorted by Relevance.
66,238 documents found, showing 1 through 10.
Next 10 →
-
Bounds on learning in polynomial time
- … required for learning. A polynomial learning algorithm with learning time ∼ N 2 in a network with N units…
- Add To MetaCart
-
On the Performance of Polynomial-time CLIQUE
- …On the Performance of Polynomial-time CLIQUE Approximation Algorithms on Very Large Graphs Steven…
- Add To MetaCart
-
Strict Polynomial-time in Simulation and Extraction
- …-knowledge proof or argument can have a strict polynomial-time black-box simulator. Similarly, we show that no…
- Cited by 28 (7 self) – Add To MetaCart
-
Polynomial Time Summary Statistics for a Generalization of MAXSAT
- … strategy is also polynomial time for fixed r, all the summary statistics can be computed from formula 6…
- Cited by 5 (3 self) – Add To MetaCart
-
Static Infinite Wait Anomaly Detection in Polynomial Time
- … cost, while retaining polynomial execution time. Both algorithms work on the sync graph, a static…
- Cited by 16 (1 self) – Add To MetaCart
-
Optimal Edge Ranking of Trees in Polynomial Time
- … the first polynomial-time algorithm to find an optimal edge ranking of a tree, placing the problem in P…
- Cited by 7 (1 self) – Add To MetaCart
-
Polynomial-Time Data Reduction for DOMINATING SET
- … graphs, where it still remains NP-complete [26], however, 1 INTRODUCTION 3 a polynomial time…
- Cited by 16 (6 self) – Add To MetaCart
-
Polynomial-Time Quantum Algorithms for Pell's Equation and the Principal Ideal Problem
- … n + y n # d = (x 1 + y 1 # d) n . It is not actually possible to have a polynomial-time…
- Cited by 39 (4 self) – Add To MetaCart
-
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
- … within some constant factor in polynomial time [PY91]. Others, like graph bisection and separation, do…
- Cited by 141 (23 self) – Add To MetaCart
-
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP
- … in polynomial time. 2.2 Separating the graph. Now we give our separator theorem, which can be viewed as a…
- Cited by 34 (11 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
