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.
Algorithms [[electronic resource] ] : International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990. Proceedings / / edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki
| Algorithms [[electronic resource] ] : International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990. Proceedings / / edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (X, 482 p.) |
| Disciplina | 511/.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Electrical engineering Operations research Decision making Algorithms Combinatorics Theory of Computation Electrical Engineering Operations Research/Decision Theory Algorithm Analysis and Problem Complexity Computation by Abstract Devices |
| ISBN | 3-540-47177-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recent progress in string algorithms -- Selection networks -- Computing edge-connectivity in multiple and capacitated graphs -- Efficient sequential and parallel algorithms for planar minimum cost flow -- Structural analyses on the complexity of inverting functions -- Oracles versus proof techniques that do not relativize -- 20-Relative neighborhood graphs are Hamiltonian -- The K-Gabriel graphs and their applications -- Parallel algorithms for generating subsets and set partitions -- Parallel algorithms for linked list and beyond -- Local tournaments and proper circular arc graphs -- Fast algorithms for the dominating set problem on permutation graphs -- Two probabilistic results on merging -- Randomized broadcast in networks -- On the construction of abstract voronoi diagrams, II -- Searching in higher dimension -- Finding extrema with unary predicates -- Implicitly searching convolutions and computing depth of collision -- Characterization for a family of infinitely many irreducible Equally Spaced Polynomials -- Distributed algorithms for deciphering -- An efficient algorithm for optimal loop parallelization (extended abstract) -- Another view on the SSS* algorithm -- Algorithms from complexity theory: Polynomial-time operations for complex sets -- Complexity cores and hard problem instances -- Spatial point location and its applications -- Sublinear merging and natural merge sort -- Constructing strongly convex approximate hulls with inaccurate primitives -- Computing puiseux-series solutions to determinatal equations via combinatorial relaxation -- A tight lower bound on the size of planar permutation networks -- Simultaneous solution of families of problems -- Algorithms for projecting points to give the most uniform distribution with applications to hashing -- Topological sweeping in three dimensions -- Finding least-weight subsequences with fewer processors -- Derandomization by exploiting redundancy and mutual independence -- Planar separators and the Euclidean norm -- On the complexity of isometric embedding in the hypercube -- Distributed function evaluation in the presence of transmission faults -- Optimal linear broadcast -- Graph augmentation problems for a specified set of vertices -- A heuristic algorithm for the k-center problem with vertex weight -- Parallel convexity algorithms for digitized images on a linear array of processors -- Parallel algorithms for labeling image components -- A hyperplane Incidence problem with applications to counting distances -- Splitting a configuration in a simplex -- Weaving patterns of lines and line segments in space -- Efficient parallel algorithms for path problems in planar directed graphs -- Parallel algorithms for finding Steiner forests in planar graphs -- Optimally managing the history of an evolving forest. |
| Record Nr. | UNISA-996465865803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation [[electronic resource] ] : Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings / / edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita
| Algorithms and Computation [[electronic resource] ] : Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings / / edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (XII, 516 p.) |
| Disciplina | 005.73 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Computers Computer mathematics Combinatorics Probabilities Data Structures Theory of Computation Computational Mathematics and Numerical Analysis Computation by Abstract Devices Probability Theory and Stochastic Processes |
| ISBN | 3-540-47501-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Methods in parallel algorithmics and who may need to know them? -- Rectilinear paths among rectilinear obstacles -- Linear time algorithms for k-cutwidth problem -- The k-edge-connectivity augmentation problem of weighted graphs -- Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity -- The application of the searching over separators strategy to solve some NP-complete problems on planar graphs -- Parallel and on-line graph coloring algorithms -- Competitive analysis of the Round Robin algorithm -- Competitive analysis of the on-line algorithms for multiple stacks systems -- Self-adjusting augmented search trees -- Algorithms for a class of Min-Cut and Max-Cut problem -- Algorithms for rectilinear optimal multicast tree problem -- Approximating treewidth and pathwidth of some classes of perfect graphs -- Graph spanners and connectivity -- Randomized range-maxima in nearly-constant parallel time -- Fault-tolerant broadcasting in binary jumping networks -- Routing problems on the mesh of buses -- Selection networks with 8n log2 n size and O(log n) depth -- Relativizations of the P=? NP and other problems: Some developments in structural complexity theory -- Boolean circuit complexity -- Searching a solid pseudo 3-sided orthoconvex grid -- An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects -- Topologically consistent algorithms related to convex polyhedra -- Characterizing and recognizing visibility graphs of Funnel-shaped polygons -- On the complexity of composite numbers -- On malign input distributions for algorithms -- Lowness and the complexity of sparse and tally descriptions -- Honest iteration schemes of randomizing algorithms -- Approximating vertices of a convex polygon with grid points in the polygon -- Algorithms for determining the geometrical congruity in two and three dimensions -- On the relationships among constrained geometric structures -- Generating small convergent systems can be extremely hard -- Chew's theorem revisited — uniquely normalizing property of nonlinear term rewriting systems -- Higher order communicating processes with Value-Passing, Assignment and return of results -- Searching informed game trees -- How to generate realistic sample problems for network optimization -- Generalized assignment problems -- Recognizing an envelope of lines in linear time -- Approximation of polygonal curves with minimum number of line segments -- Wiring knock-knee layouts: A global approach -- Algorithms for finding non-crossing paths with minimum total length in plane graphs -- On symmetry of information and polynomial time invertibility -- On probabilistic ACC circuits with an exact-threshold output gate -- Computational and statistical indistinguishabilities -- On symmetric differences of NP-hard sets with weakly-P-selective sets -- Restricted track assignment with applications -- A simple test for the consecutive ones property -- The longest common subsequence problem for small alphabet size between many strings -- The implicit dictionary problem revisited -- Sorting in-place with a worst case complexity of n log n?1.3n+O(log n) comparisons and ? n log n+O(1) transports -- Sorting and/by merging finger trees. |
| Record Nr. | UNISA-996465513903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Drawing [[electronic resource] ] : 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers / / edited by Seok-Hee Hong, Takao Nishizeki, Wu Quan
| Graph Drawing [[electronic resource] ] : 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers / / edited by Seok-Hee Hong, Takao Nishizeki, Wu Quan |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIII, 401 p.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Computer graphics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Computer Graphics Data Science |
| ISBN | 3-540-77537-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Computing Symmetries of Combinatorial Objects -- Large-Scale Graphics: Digital Nature and Laser Projection -- Papers -- Crossing Number of Graphs with Rotation Systems -- A Bipartite Strengthening of the Crossing Lemma -- Improvement on the Decay of Crossing Numbers -- Crossing Numbers and Parameterized Complexity -- Characterization of Unlabeled Level Planar Graphs -- Cyclic Level Planarity Testing and Embedding -- Practical Level Planarity Testing and Layout with Embedding Constraints -- Minimum Level Nonplanar Patterns for Trees -- Straight-Line Orthogonal Drawings of Binary and Ternary Trees -- Polynomial Area Bounds for MST Embeddings of Trees -- Moving Vertices to Make Drawings Plane -- Point-Set Embedding of Trees with Edge Constraints -- Representation of Planar Hypergraphs by Contacts of Triangles -- The Complexity of Several Realizability Problems for Abstract Topological Graphs -- Efficient Extraction of Multiple Kuratowski Subdivisions -- Cover Contact Graphs -- Matched Drawings of Planar Graphs -- Maximum Upward Planar Subgraphs of Embedded Planar Digraphs -- Minimizing the Area for Planar Straight-Line Grid Drawings -- On Planar Polyline Drawings -- Constrained Stress Majorization Using Diagonally Scaled Gradient Projection -- Line Crossing Minimization on Metro Maps -- Algorithms for Multi-criteria One-Sided Boundary Labeling -- Multi-circular Layout of Micro/Macro Graphs -- Constrained Simultaneous and Near-Simultaneous Embeddings -- Simultaneous Geometric Graph Embeddings -- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces -- Clustered Planarity: Small Clusters in Eulerian Graphs -- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge -- Colorability in Orthogonal Graph Drawing -- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs -- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices -- LunarVis – Analytic Visualizations of Large Graphs -- Visualizing Internet Evolution on the Autonomous Systems Level -- Treemaps for Directed Acyclic Graphs -- Drawing Graphs with GLEE -- Graph Drawing Contest -- Graph Drawing Contest Report. |
| Record Nr. | UNISA-996465775603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Drawing : 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers / / edited by Seok-Hee Hong, Takao Nishizeki, Wu Quan
| Graph Drawing : 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers / / edited by Seok-Hee Hong, Takao Nishizeki, Wu Quan |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIII, 401 p.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Computer graphics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Computer Graphics Data Science |
| ISBN | 3-540-77537-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Computing Symmetries of Combinatorial Objects -- Large-Scale Graphics: Digital Nature and Laser Projection -- Papers -- Crossing Number of Graphs with Rotation Systems -- A Bipartite Strengthening of the Crossing Lemma -- Improvement on the Decay of Crossing Numbers -- Crossing Numbers and Parameterized Complexity -- Characterization of Unlabeled Level Planar Graphs -- Cyclic Level Planarity Testing and Embedding -- Practical Level Planarity Testing and Layout with Embedding Constraints -- Minimum Level Nonplanar Patterns for Trees -- Straight-Line Orthogonal Drawings of Binary and Ternary Trees -- Polynomial Area Bounds for MST Embeddings of Trees -- Moving Vertices to Make Drawings Plane -- Point-Set Embedding of Trees with Edge Constraints -- Representation of Planar Hypergraphs by Contacts of Triangles -- The Complexity of Several Realizability Problems for Abstract Topological Graphs -- Efficient Extraction of Multiple Kuratowski Subdivisions -- Cover Contact Graphs -- Matched Drawings of Planar Graphs -- Maximum Upward Planar Subgraphs of Embedded Planar Digraphs -- Minimizing the Area for Planar Straight-Line Grid Drawings -- On Planar Polyline Drawings -- Constrained Stress Majorization Using Diagonally Scaled Gradient Projection -- Line Crossing Minimization on Metro Maps -- Algorithms for Multi-criteria One-Sided Boundary Labeling -- Multi-circular Layout of Micro/Macro Graphs -- Constrained Simultaneous and Near-Simultaneous Embeddings -- Simultaneous Geometric Graph Embeddings -- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces -- Clustered Planarity: Small Clusters in Eulerian Graphs -- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge -- Colorability in Orthogonal Graph Drawing -- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs -- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices -- LunarVis – Analytic Visualizations of Large Graphs -- Visualizing Internet Evolution on the Autonomous Systems Level -- Treemaps for Directed Acyclic Graphs -- Drawing Graphs with GLEE -- Graph Drawing Contest -- Graph Drawing Contest Report. |
| Record Nr. | UNINA-9910767534503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph Theory and Algorithms [[electronic resource] ] : 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings / / edited by N. Saito, T. Nishizeki
| Graph Theory and Algorithms [[electronic resource] ] : 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings / / edited by N. Saito, T. Nishizeki |
| Edizione | [1st ed. 1981.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1981 |
| Descrizione fisica | 1 online resource (VIII, 220 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-38661-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Dividing a system into almost unidirectional blocks -- A linear algorithm for five-coloring a planar graph -- On the layering problem of multilayer PWB wiring -- A status on the linear arboricity -- On centrality functions of a graph -- Canonical decompositions of symmetric submodular systems -- The subgraph homeomorphism problem on reducible flow graphs -- Combinatorial problems on series-parallel graphs -- A graph-planarization algorithm and its application to random graphs -- Some common properties for regularizable graphs, edge-critical graphs and b-graphs -- "Dualities" in graph theory and in the related fields viewed from the metatheoretical standpoint -- On central trees of a graph -- On polynomial time computable problems -- Homomorphisms of graphs and their global maps -- Algorithms for some intersection graphs -- An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph -- Characterization of polyhex graphs as applied to chemistry -- The two disjoint path problem and wire routing design. |
| Record Nr. | UNISA-996465510003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1981 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||