Result 61 to 80 of 158 total
Reconstruction of a graph from 2-vicinities of its vertices. (English)
Ahlswede, Rudolf (ed.) et al., General theory of information transfer and combinatorics. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 21, 347-351 (2005).
61
On square-Hamiltonian graphs. (English)
Algebra Discrete Math. 2005, No. 3, 56-59 (2005).
62
Finite-type invariants for graphs and graph reconstructions. (English)
Adv. Math. 186, No. 1, 181-228 (2004).
63
Topics in graph automorphisms and reconstruction. (English)
London Mathematical Society Student Texts 54. Cambridge: Cambridge University Press (ISBN 0-521-82151-7/hbk; 0-521-52903-4/pbk). xii, 159~p. \sterling~16.99, \$~25.00/pbk; \sterling~47.50, \$~70.00/hbk (2003).
64
On the topology of generalized semi-infinite optimization. (English)
J. Convex Anal. 9, No. 2, 665-691 (2002).
65
Orthogonal polygon reconstruction from stabbing information. (English)
Comput. Geom. 23, No.1, 69-83 (2002).
66
Multiscale scientific computation: Review 2001. (English)
Barth, Timothy J. (ed.) et al., Multiscale and multiresolution methods. Theory and applications. Berlin: Springer. Lect. Notes Comput. Sci. Eng. 20, 3-95 (2002).
67
Algebraic graph invariants and reconstruction. (Invariants algébriques de graphes et reconstruction.) (French)
C. R. Acad. Sci., Paris, Sér. I, Math. 333, No.9, 821-826 (2001).
68
Point and line segment reconstruction from visibility information. (English)
Int. J. Comput. Geom. Appl. 10, No. 2, 189-200 (2000).
69
3D geometry reconstruction from multiple segmented surface descriptions using neuro-fuzzy similarity measures. (English)
J. Intell. Robot. Syst. 29, No.4, 389-431 (2000).
70
Efficient subgraph isomorphism with ‘a priori’ knowledge. Application to 3D reconstruction of buildings for cartography. (English)
Ferri, Francesc J. (ed.) et al., Advances in pattern recognition. Joint IAPR international workshops SSPR 2000 and SPR 2000, Alicante, Spain, August 30 - September 1, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1876, 427-436 (2000).
71
Redundancy elimination in the estimation of multiple paths. (English)
Djaferis, Theodore E. (ed.) et al., System theory: modeling, analysis, and control. Papers from the symposium on advances in system theory held in honor of the 65th birthday of Sanjoy K. Mitter, Cambridge, MA, USA, October 15-16, 1999. Boston: Kluwer Academic Publishers. Kluwer Int. Ser. Eng. Comput. Sci. 518, 181-188 (2000).
72
Reconstruction of weighted graphs by their spectrum. (English)
Eur. J. Comb. 21, No.5, 641-650 (2000).
73
Phylogeny numbers for graphs with two triangles. (English)
Discrete Appl. Math. 103, No.1-3, 191-207 (2000).
74
Algorithmic strategies in combinatorial chemistry. (English)
Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms. San Francisco, CA, USA, January 9-11, 2000. Philadelphia, PA: SIAM. 275-284 (2000).
75
On the reconstruction of the characteristic polynomial of a graph. (English)
Discrete Math. 212, No.1-2, 45-52 (2000).
76
Reconstructing the topology of a CAD model ‒ a discrete approach. (English)
Algorithmica 26, No.1, 126-147 (2000).
77
The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements. (English)
Electron. J. Comb. 7, No.1, Research paper R12, 9 p. (2000); printed version J. Comb. 7, No.1 (2000).
78
The two classes of singular line graphs of trees. (English)
Rend. Semin. Mat. Messina, Ser. II 20, No.5, Suppl., 167-180 (1999).
79
On the $p$-connectedness of graphs—a survey. (English)
Discrete Appl. Math. 95, No.1-3, 11-33 (1999).
80
Result 61 to 80 of 158 total
Start
Contact
Print
General Help
