T. Kloks. Treewidth. Number 842 in Lecture Notes in Computer Science. Springer-Verlag, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Generating Irregular Partitionable Data Structures - Panangaden, Verbrugge (Correct)
....Figure 15) 39 8 Tree Width Tree width is a concept in graph theory meant to model how close a given graph is to a tree. More importantly, a bounded tree width specifies a large class of graphs for which polynomial time (and often linear time) algorithms exist for a variety of problems in NP [4,5,13,64,96]. If we can find a tree partition scheme for a given graph, however, it is possible to adapt the tree partition scheme into a tree decomposition, and the tree width is then necessarily bounded. First, however, we must define tree width: Definition 50 Let T = N, L) be a tree with nodes N and ....
Tom Kloks. Treewidth: Computations and Approximations. Number 842 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1994.
A Parallel Solution Strategy For Irregular, Dynamic Problems - Verbrugge (1996) (Correct)
....n n e n e e r n e e n e e e Rule 1 Axiom Rule 5 Rules 2,3 Rule 4 Figure 3.15: A grammar requiring contexts; right leaves are expanding only if the left sibling is not a leaf. for which polynomial time (and often linear time) algorithms exist for a variety of problems in NP [Arn85, ALS88, Cou90a, Klo94, Sli82] If we can find a tree partition scheme for a given graph, however, it is possible to adapt the tree partition scheme into a tree decomposition, and the tree width is then necessarily bounded. First, however, we must define tree width: Definition 3.8.1 Let T = N; L) be a tree with nodes ....
Tom Kloks. Treewidth: Computations and Approximations. Number 842 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1994.
Generating Irregular Partitionable Data Structures - Panangaden, Verbrugge (1996) (Correct)
....is not a leaf. 7 Tree Width Tree width is a concept in graph theory meant to model how close a given graph is to a tree. More importantly, a bounded tree width specifies a large class of graphs for which polynomialtime (and often linear time) algorithms exist for a variety of problems in NP [3, 4, 8, 28, 49]. If we can find a tree partition scheme for a given graph, however, it is possible to adapt the tree partition scheme into a tree decomposition, and the tree width is then necessarily bounded. First, however, we must define tree width: Definition 7.1 Let T = N; L) be a tree with nodes N and ....
Tom Kloks. Treewidth: Computations and Approximations. Number 842 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1994.
Motion Estimation Using Central Panoramic Cameras - Svoboda, al. (1998) (14 citations) Self-citation (Svoboda Pajdla Aclav Panoramic) (Correct)
....and a perspective camera. Fig. 3. Three combinations lens mirror. erty which is a necessary condition for the existence of tractable geometry inherent to the moving sensor and independent of the scene structure. Panoramic cameras with this property shall be called central panoramic cameras, [13]. In this case the model of the panoramic camera can be decomposed into a central projection from space onto a curved surface of the mirror and a central projection from the surface of the mirror into the image plane. B. Model of panoramic camera with hyperbolic mirror Figure 4 shows the ....
....(5) F h2 X p plane x z projection R,t e q e X 2 e 1 C 1 2 2 2 n 1 X h1 F 1 q e 1 y C2 II. mirror I. mirror camera projection center Fig. 5. The epipolar geometry of two panoramic cameras with hyperbolic mirrors. Details about the epipolar geometry can be found in [13], 15] Introducing an antisymmetric matrix S S = 2 4 0 t z t y t z 0 t x t y t x 0 3 5 ; 6) we can rewrite the coplanarity constraint (5) in the matrix form as X h T 2 EX h1 = 0; 7) where E = RS is the essential matrix. This essential matrix is the same as proposed by Hartley [17] ....
[Article contains additional citation context not shown here]
Tomas Svoboda, Tomas Pajdla, and Vaclav Hlavac, \Epipolar geometry for panoramic cameras," in the fth European Conference on Computer Vision, Freiburg, Germany, Hans Burkhardt and Neumann Bernd, Eds. June 1998, number 1406 in Lecture Notes in Computer Science, pp. 218-232, Springer.
Parameterized Power Domination Complexity - Kneis, Mölle, Richter, Rossmanith (2004) (Correct)
No context found.
T. Kloks. Treewidth. Number 842 in Lecture Notes in Computer Science. Springer-Verlag, 1994.
Parameterized Power Domination Complexity - Kneis, Mölle, Richter, Rossmanith (2004) (Correct)
No context found.
T. Kloks. Treewidth. Number 842 in Lecture Notes in Computer Science. Springer-Verlag, 1994.
A New Satisfiability Algorithm with Applications to Max-Cut - Kneis, Rossmanith (2005) (Correct)
No context found.
T. Kloks. Treewidth. Number 842 in Lecture Notes in Computer Science. Springer-Verlag, 1994.
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