LEADER 00845nam0-22002891i-450- 001 990004042400403321 005 20051103125551.0 035 $a000404240 035 $aFED01000404240 035 $a(Aleph)000404240FED01 035 $a000404240 100 $a19990604d1985----km-y0itay50------ba 101 0 $aita 105 $ay-------00-y- 200 1 $aDonna e Chiesa$ela testimonianza di Giovanni Crisostomo$fCettina Mitiello 210 $aPalermo$cEdi Oftes$d1985 215 $a249 p.$d24 cm 225 1 $aStudi$eCollana della Facoltą Teologica di Sicilia$v3 676 $a248.843$v21$zita 700 1$aMilitello,$bCettina$0154001 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990004042400403321 952 $a248.843 MIL 1$bD.D.S.1503$fFLFBC 959 $aFLFBC 996 $aDonna e Chiesa$9471464 997 $aUNINA LEADER 05454nam 22007575 450 001 996466235803316 005 20200705182903.0 010 $a3-540-68072-1 024 7 $a10.1007/3-540-62559-3 035 $a(CKB)1000000000234595 035 $a(SSID)ssj0000323618 035 $a(PQKBManifestationID)11268846 035 $a(PQKBTitleCode)TC0000323618 035 $a(PQKBWorkID)10300099 035 $a(PQKB)10341591 035 $a(DE-He213)978-3-540-68072-7 035 $a(PPN)155234110 035 $a(EXLCZ)991000000000234595 100 $a20121227d1997 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph-Theoretic Concepts in Computer Science$b[electronic resource] $e22nd International Workshop, WG '96, Cadenabbia, Italy, June 12-14, 1996, Proceedings /$fedited by Fabrizio D'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela 205 $a1st ed. 1997. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997. 215 $a1 online resource (XII, 416 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1197 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-62559-3 327 $aHypergraphs and decision trees -- Improved approximations of independent dominating set in bounded degree graphs -- A new characterization of P 4-connected graphs -- Node rewriting in hypergraphs -- On ?-partitioning the n-cube -- Embedding complete binary trees in product graphs -- Clique and anticlique partitions of graphs -- Optimal parallel routing in star graphs -- Counting edges in a dag -- Closure properties of context-free Hyperedge Replacement Systems -- Upward drawings of search trees -- More general parallel tree contraction: Register allocation and broadcasting in a tree -- System diagnosis with smallest risk of error -- Efficient algorithms for shortest path queries in planar digraphs -- LexBFS-orderings and powers of graphs -- Efficient Union-Find for planar graphs and other sparse graph classes -- Switchbox routing in VLSI design: Closing the complexity gap -- Detecting diamond necklaces in labeled dags -- Algebraic graph derivations for graphical calculi -- Definability equals recognizability of partial 3-trees -- One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs -- Approximate maxima finding of continuous functions under restricted budget (Extended abstract) -- The Optimal Cost Chromatic Partition problem for trees and interval graphs -- Modifying networks to obtain low cost trees -- On the hardness of allocating frequencies for hybrid networks -- Homogeneous sets and domination problems -- Independent spanning trees of product graphs -- Designing distrance-preserving fault-tolerant topologies -- Shortest path algorithms for nearly acyclic directed graphs -- Computing disjoint paths with length constraints -- Generalized edge-rankings of trees. 330 $aThis book constitutes the carefully refereed post-proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG '96, held in Cadenabbia, Italy, in June 1996. The 30 revised full papers presented in the volume were selected from a total of 65 submissions. This collection documents the state of the art in the area. Among the topics addressed are graph algorithms, graph rewriting, hypergraphs, graph drawing, networking, approximation and optimization, trees, graph computation, and others. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1197 606 $aComputers 606 $aApplied mathematics 606 $aEngineering mathematics 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aComputer graphics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aApplications of Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M13003 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputers. 615 0$aApplied mathematics. 615 0$aEngineering mathematics. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aComputer graphics. 615 14$aTheory of Computation. 615 24$aApplications of Mathematics. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputation by Abstract Devices. 615 24$aData Structures. 615 24$aComputer Graphics. 676 $a004.0151 702 $aD'Amore$b Fabrizio$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFranciosa$b Paolo Giulio$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMarchetti-Spaccamela$b Alberto$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466235803316 996 $aGraph-Theoretic Concepts in Computer Science$9772292 997 $aUNISA LEADER 02459nam 2200625 450 001 9910809889303321 005 20230213215434.0 010 $a3-11-135485-7 024 7 $a10.1515/9783111354859 035 $a(CKB)3390000000035719 035 $a(EBL)3043243 035 $a(OCoLC)922946394 035 $a(SSID)ssj0001051987 035 $a(PQKBManifestationID)11579797 035 $a(PQKBTitleCode)TC0001051987 035 $a(PQKBWorkID)11074957 035 $a(PQKB)11079177 035 $a(MiAaPQ)EBC3043243 035 $a(DE-B1597)89841 035 $a(OCoLC)1013948431 035 $a(OCoLC)853256476 035 $a(DE-B1597)9783111354859 035 $a(Au-PeEL)EBL3043243 035 $a(CaPaEBR)ebr10760272 035 $a(EXLCZ)993390000000035719 100 $a20140815h19701970 uy 0 101 0 $aeng 135 $aur||#|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDescriptive syntax of the old English charters /$fCharles Carlton 205 $aReprint 2013 210 1$aHague, Netherlands :$cMouton,$d1970. 210 4$d©1970 215 $a1 online resource (200 p.) 225 1 $aJanua Linguarum ;$v111 300 $aDescription based upon print version of record. 311 0 $a3-11-208512-4 311 0 $a90-279-0744-7 320 $aIncludes bibliographical references and index. 327 $tFront matter --$tPREFACE --$tTABLE OF CONTENTS --$tLIST OF TABLES --$tLIST OF ABBREVIATIONS --$tINTRODUCTION: PREVIOUS STUDIES IN OLD ENGLISH SYNTAX --$tI. BASIC SYNTACTIC UNITS IN OLD ENGLISH --$tII. BASIC ELEMENTS IN OLD ENGLISH SENTENCES --$tIII. SECONDARY ELEMENTS (MODIFIERS) IN OLD ENGLISH SENTENCES --$tIV. THE DEPENDENT CLAUSE --$tV. NEGATION --$tVI. SYNTACTIC SIGNALS: NOUN, PRONOUN, AND ADJECTIVE --$tVII. SYNTACTIC SIGNALS OF VERBS --$tVIII. WORD ORDER --$tIX. SUMMARY AND CONCLUSIONS --$tSELECTED BIBLIOGRAPHY --$tINDEX 410 0$aJanua linguarum.$pSeries practica ;$v111. 606 $aEnglish language$yOld English, ca. 450-1100$xSyntax 607 $aGreat Britain$vCharters, grants, privileges 615 0$aEnglish language$xSyntax. 676 $a429/.5 700 $aCarlton$b Charles Rogers$f1919-$01692653 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910809889303321 996 $aDescriptive syntax of the old English charters$94069899 997 $aUNINA