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] ] : 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings / / edited by Rolf H. Möhring
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings / / edited by Rolf H. Möhring |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (X, 382 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer science—Mathematics Data structures (Computer science) Combinatorics Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Data Structures |
| ISBN | 3-540-69643-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Gadgets, approximation, and linear programming: Improved hardness results for cut and satisfiability problems -- Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT -- On the number of simple cycles in planar graphs -- On the separable-homogeneous decomposition of graphs -- Pseudo-hamiltonian graphs -- Acyclic orientations for deadlock prevention in interconnection networks -- Weak-order extensions of an order -- An upper bound for the maximum cut mean value -- NP-completeness results for minimum planar spanners -- Computing the independence number of dense triangle-free graphs -- Algorithms for the treewidth and minimum fill-in of HHD-free graphs -- Block decomposition of inheritance hierarchies -- Minimal elimination ordering inside a given chordal graph -- On-line algorithms for networks of temporal constraints -- Parallel algorithms for treewidth two -- On optimal graphs embedded into paths and rings, with analysis using l 1-spheres -- On greedy matching ordering and greedy matchable graphs -- Off-line and on-line call-scheduling in stars and trees -- Computational complexity of the Krausz dimension of graphs -- Asteroidal sets in graphs -- Complexity of colored graph covers I. Colored directed multigraphs -- A syntactic approach to random walks on graphs -- Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs -- Large networks with small diameter -- The bounded tree-width problem of context-free graph languages -- Structured programs have small tree-width and good register allocation -- A measure of parallelization for the lexicographically first maximal subgraph problems -- Make your enemies transparent -- Optimal fault-tolerant ATM-routings for biconnected graphs. |
| Record Nr. | UNINA-9910144905803321 |
| 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] ] : 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings / / edited by Rolf H. Möhring
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings / / edited by Rolf H. Möhring |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (X, 382 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer science—Mathematics Data structures (Computer science) Combinatorics Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Data Structures |
| ISBN | 3-540-69643-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Gadgets, approximation, and linear programming: Improved hardness results for cut and satisfiability problems -- Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT -- On the number of simple cycles in planar graphs -- On the separable-homogeneous decomposition of graphs -- Pseudo-hamiltonian graphs -- Acyclic orientations for deadlock prevention in interconnection networks -- Weak-order extensions of an order -- An upper bound for the maximum cut mean value -- NP-completeness results for minimum planar spanners -- Computing the independence number of dense triangle-free graphs -- Algorithms for the treewidth and minimum fill-in of HHD-free graphs -- Block decomposition of inheritance hierarchies -- Minimal elimination ordering inside a given chordal graph -- On-line algorithms for networks of temporal constraints -- Parallel algorithms for treewidth two -- On optimal graphs embedded into paths and rings, with analysis using l 1-spheres -- On greedy matching ordering and greedy matchable graphs -- Off-line and on-line call-scheduling in stars and trees -- Computational complexity of the Krausz dimension of graphs -- Asteroidal sets in graphs -- Complexity of colored graph covers I. Colored directed multigraphs -- A syntactic approach to random walks on graphs -- Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs -- Large networks with small diameter -- The bounded tree-width problem of context-free graph languages -- Structured programs have small tree-width and good register allocation -- A measure of parallelization for the lexicographically first maximal subgraph problems -- Make your enemies transparent -- Optimal fault-tolerant ATM-routings for biconnected graphs. |
| Record Nr. | UNISA-996465754403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 16th International Workshop WG '90, Berlin, Germany, June 20-22, 1990 / / edited by Rolf H. Möhring
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 16th International Workshop WG '90, Berlin, Germany, June 20-22, 1990 / / edited by Rolf H. Möhring |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (XIII, 367 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Combinatorics Data structures (Computer science) Logic design Theory of Computation Algorithm Analysis and Problem Complexity Computation by Abstract Devices Data Structures Logic Design |
| ISBN | 3-540-46310-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Optimal parallel algorithms for sparse graphs -- Finding minimally weighted subgraphs -- On the complexity of some coloring games -- A generalized best-first search method in graphs -- Avoiding matrix multiplication -- Induced subraph isomorphism for cographs is NP-complete -- On feedback problems in planar digraphs -- Recognizing binary hamming graphs in O(n 2 log n) time -- Vertex-disjoint trees and boundary single-layer routing -- Bounds on the quality of approximate solutions to the group Steiner problem -- Two polynomial problems in PLA folding -- The VLSI layout problem in various embedding models -- Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems -- Deterministic message routing in faulty hypercubes -- On complexity of a message-routing strategy for multicomputer systems -- Embeddings of treelike graphs into 2-dimensional meshes -- Diagnosis of t/s-diagnosable systems -- Deciding 1-solvability of distributed task is NP-hard -- Remarks on some concurrency measures -- On the rectilinear art gallery problem algorithmic aspects -- Separation problems and circular arc systems -- Genus of orders and lattices -- Comparing the expressibility of two languages formed using NP-complete graph operators -- Decomposition of linear recursive logic programs -- On the transition graphs of automata and grammars -- Algebraic approach to graph transformation based on single pushout derivations. |
| Record Nr. | UNISA-996465391303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Robust and Online Large-Scale Optimization [[electronic resource] ] : Models and Techniques for Transportation Systems / / edited by Ravindra K. Ahuja, Rolf H. Möhring, Christos D. Zaroliagis
| Robust and Online Large-Scale Optimization [[electronic resource] ] : Models and Techniques for Transportation Systems / / edited by Ravindra K. Ahuja, Rolf H. Möhring, Christos D. Zaroliagis |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XVIII, 423 p.) |
| Disciplina | 004n/a |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computers
Electronic digital computers—Evaluation Computers, Special purpose Computer simulation Security systems Discrete mathematics Hardware Performance and Reliability System Performance and Evaluation Special Purpose and Application-Based Systems Computer Modelling Security Science and Technology Discrete Mathematics |
| ISBN | 3-642-05465-X |
| Classificazione |
004
BAU 853f MAT 910f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Robustness and Recoverability: New Concepts -- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications -- Recoverable Robustness in Shunting and Timetabling -- Light Robustness -- Incentive-Compatible Robust Line Planning -- A Bicriteria Approach for Robust Timetabling -- Robust Timetabling and Route Planning -- Meta-heuristic and Constraint-Based Approaches for Single-Line Railway Timetabling -- Engineering Time-Expanded Graphs for Faster Timetable Information -- Time-Dependent Route Planning -- The Exact Subgraph Recoverable Robust Shortest Path Problem -- Efficient Timetable Information in the Presence of Delays -- Robust Planning under Scarce Resources -- Integrating Robust Railway Network Design and Line Planning under Failures -- Effective Allocation of Fleet Frequencies by Reducing Intermediate Stops and Short Turning in Transit Systems -- Shunting for Dummies: An Introductory Algorithmic Survey -- Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol -- Online Planning: Delay and Disruption Management -- Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data -- Rescheduling Dense Train Traffic over Complex Station Interlocking Areas -- Online Train Disposition: To Wait or Not to Wait? -- Disruption Management in Passenger Railway Transportation. |
| Record Nr. | UNISA-996465860203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||