Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 22nd International Workshop, WG '96, Cadenabbia, Italy, June 12-14, 1996, Proceedings / / edited by Fabrizio D'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 22nd International Workshop, WG '96, Cadenabbia, Italy, June 12-14, 1996, Proceedings / / edited by Fabrizio D'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XII, 416 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Applied mathematics Engineering mathematics Algorithms Data structures (Computer science) Computer graphics Theory of Computation Applications of Mathematics Algorithm Analysis and Problem Complexity Computation by Abstract Devices Data Structures Computer Graphics |
| ISBN | 3-540-68072-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Hypergraphs 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. |
| Record Nr. | UNINA-9910144927403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 22nd International Workshop, WG '96, Cadenabbia, Italy, June 12-14, 1996, Proceedings / / edited by Fabrizio D'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 22nd International Workshop, WG '96, Cadenabbia, Italy, June 12-14, 1996, Proceedings / / edited by Fabrizio D'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XII, 416 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Applied mathematics Engineering mathematics Algorithms Data structures (Computer science) Computer graphics Theory of Computation Applications of Mathematics Algorithm Analysis and Problem Complexity Computation by Abstract Devices Data Structures Computer Graphics |
| ISBN | 3-540-68072-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Hypergraphs 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. |
| Record Nr. | UNISA-996466235803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||