F. Berman, D. Johnson, T. Leighton and P. W. Shor, Generalized Planar Matching, Journal of Algorithms, 11(1990), pp 153-184. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Graph Clustering: Complexity, Sequential and Parallel Algorithms - Abbas (1995) (Correct)
....shown to be NP complete on general graphs; partitioning into cliques, a special case of PV MF in NP complete on general graphs. We first survey results on various special cases of PV MF , then talk about our contribution to that problem and where it fits among previous results. Berman et al. [8] prove that the special case PV C (Partitioning Vertices into Cliques) is NP complete on planar graphs. Grotschel, Lov asz and Schrijver [45] show that it has a polynomial time solution on perfect graphs. Special algorithms to solve PV C on chordal graphs, permutation graphs, comparability and ....
F. Berman, D. Johnson, T. Leighton, P.W. Shor, and L. Snyder. Generalized planar matching. J. Algorithms, 11:153--184, 1990.
Tile Invariants: New Horizons - Pak (2000) (Correct)
....the authors do not compute the group of invariants, it can be easily determined from either local move property or coloring arguments. Let us note that the polynomial algorithms for tileability exist only for simply connected regions, as in general case the problem is NP complete [Ro] see also [BJLS]) 16 IGOR PAK 7.3 L trominoes. Let T be the set of four rotations of L trominoes. We showed in [P] that G (T; B) E(T) Z Theta Z 2 3 . The proof involves some explicit coloring arguments. Figure 7.3. Four L trominoes. The set T has no local move property, as shown in [P] There, we ....
F. Berman, D. Johnson, T. Leighton, P. Shor, Generalized planar matching, J. Algorithms 11 (1990), 153--184.
Geometric Methods for Optical Character Recognition - Sazaklis (1997) (Correct)
....arcs. Therefore we have employ many to one matchings of graph paths to single features in the prototype. Thus our problem is subgraph homeomorphism. What if we use the fact that our graphs are planar Relevant results do not seem very promising for a polynomial time solution: Fran Berman et al. [6] proves that maximum planar H matching (finding the maximum number of node disjoint copies of a fixed planar graph H into a variable planar graph G) is NP complete. However, we do not know of any result for the case of labeled planar graphs. Future research will be directed towards exploiting ....
F. Berman, D. Johnson, T. Leighton, P. Shor, and L. Snyder. Generalized planar matching. Journal of Algorithms, 11:153--184, 1990. 132 BIBLIOGRAPHY 133
Tiling a Polygon with Rectangles - Kenyon, Kenyon (1992) (13 citations) (Correct)
....known from Mike Robson [2] that tiling a region with holes with 1 Theta m and n Theta 1 tiles is NPcomplete as soon as m 2 and l 3. On the other hand, efficient tiling algorithms and criteria have been obtained for restricted classes of polygons [3] 4] As far as rectangles are concerned, from [5] we see that our tiling problem is NP complete for polygonal regions Supported by CNRS URA 1398. y supported by CNRS. with holes as soon as k 2 and l 3 (optimal tile salvage problem) 2 Tiling a polygon with 1 Theta m and l Theta 1 tiles We will only present the algorithm in the case ....
Fran Berman, David Johnson, Tom Leighton, Peter W. Shor, Larry Snyder, "Generalized Planar Matching", Journal of Algorithms 11, no 2, 1990, pp. 153-184.
Computationally Manageable Combinatorial Auctions - Rothkopf, Pekec, Harstad (1998) (184 citations) (Correct)
....for an auction of X even if we allow only 2 2 2 rectangles to be allowable combined bids. Theorem 12 Let X = n] 2 [n] Let B = fB a;a 1;b;b 1 : 1 a n and 1 b ng where B a;b;c;d : f(x; y) 2 X : a x b and c y dg. Then finding a COPT is a NP complete problem. Proof : As was shown in [2], the optimal 2 2 2 salvage problem is NP complete. The input for this problem is an n 2 n grid and some set S of unit squares with integer coordinates. A 2 2 2 rectangle with integer vertices is called functional if all four of its unit squares belong to S. The problem is to determine a maximal ....
Berman, F., D. Johnson, T. Leighton, P. W. Shor, and L. Snyder, "Generalized Planar Matching", Journal of Algorithms 11 (1990), pp. 153-184.
Intractability Results for Certain Graph-Theoretic Optimization .. - Venkatesan (1997) (Correct)
No context found.
F. Berman, D. Johnson, T. Leighton and P. W. Shor, Generalized Planar Matching, Journal of Algorithms, 11(1990), pp 153-184.
Tiling a Polygon with Rectangles - Kenyon, Kenyon (1992) (13 citations) (Correct)
No context found.
Fran Berman, David Johnson, Tom Leighton, Peter W. Shor, Larry Snyder, "Generalized Planar Matching", Journal of Algorithms 11, no 2, 1990, pp. 153-184.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC