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] ] : 20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings / / edited by Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings / / edited by Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XI, 425 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Discrete mathematics Algorithms Combinatorics Computer logic Theory of Computation Discrete Mathematics Algorithm Analysis and Problem Complexity Logics and Meanings of Programs |
| ISBN | 3-540-49183-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Domino treewidth -- A lower bound for treewidth and its consequences -- Tree-width and path-width of comparability graphs of interval orders -- A declarative approach to graph based modeling -- Multilevel graph grammars -- The algorithmic use of hypertree structure and maximum neighbourhood orderings -- On domination elimination orderings and domination graphs -- Complexity of graph covering problems -- Dominoes -- GLB-closures in directed acyclic graphs and their applications -- Minimum vertex cover, distributed decision-making, and communication complexity -- Cartesian products of graphs as spanning subgraphs of de Bruijn graphs -- Specification of graph translators with triple graph grammars -- Using programmed graph rewriting for the formal specification of a configuration management system -- Exponential time analysis of confluent and boundary eNCE graph languages -- Time-optimal tree computations on sparse meshes -- Prefix graphs and their applications -- The complexity of broadcasting in planar and decomposable graphs -- The maximal f-dependent set problem for planar graphs is in NC -- On-line convex planarity testing -- Book embeddings and crossing numbers -- Measuring the distance to series-parallelity by path expressions -- Labelled trees and pairs of input-output permutations in priority queues -- Rankings of graphs -- Bypass strong V-structures and find an isomorphic labelled subgraph in linear time -- Efficient algorithms for a mixed k-partition problem of graphs without specifying bases -- Fugitive-search games on graphs and related parameters -- New approximation results on graph matching and related problems -- New lower bounds and hierarchy results for restricted branching programs -- On-line algorithms for satisfiability problems with uncertainty -- NC algorithms for antidirected hamiltonian paths and cycles in tournaments -- Directed path graph isomorphism. |
| Record Nr. | UNISA-996465930103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : International Workshop WG '86 Bernried, Federal Republic of Germany, June 17-19, 1986, Proceedings / / edited by Gottfried Tinhofer, Gunther Schmidt
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : International Workshop WG '86 Bernried, Federal Republic of Germany, June 17-19, 1986, Proceedings / / edited by Gottfried Tinhofer, Gunther Schmidt |
| Edizione | [1st ed. 1987.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
| Descrizione fisica | 1 online resource (X, 314 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Combinatorics Computer communication systems Theory of Computation Computation by Abstract Devices Computer Communication Networks |
| ISBN | 3-540-47415-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A simple linear-time algorithm to recognize interval graphs -- On approximation algorithms for Steiner's problem in graphs -- Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity -- ADA concurrency specified by graph grammars -- Cabri, an interactive system for graph manipulation -- An interactive graphical manipulation system for higher objects based on relational algebra -- Behaviour preserving refinements of Petri nets -- The bandwidth of planar distributive lattices -- The node visit cost of brother trees -- Searching connected components in very large grid graphs -- A simple implementation of Warshall's algorithm on a vlsi chip -- On some generalizations of outerplanar graphs: Results and open problems -- Recognizing outerplanar graphs in linear time -- Graphs and graph polynomials of interest in chemistry -- Applications of parallel scheduling to perfect graphs -- A graph-theoretic approach for designing fair distributed resource scheduling algorithms -- Improved diameter bounds for altered graphs -- Separability of sets of polygons -- Centipede graphs and visibility on a cylinder -- The diameter of connected components of random graphs -- An algorithm for testing planarity of hierarchical graphs -- EDM — A data model for electronic CAD/CAM-applications. |
| Record Nr. | UNISA-996465674403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||