Graph-theoretic concepts in computer science : 20th International Workshop, WG '94, Herrsching, Germany, June 16 18, 1994 : proceedings
This volume presents the proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '94), held in Herrsching, Germany in June 1994. The volume contains 32 thoroughly revised papers selected from 66 submissions and provides an up-to-date snapshot of the re...
保存先:
| 団体著者: | |
|---|---|
| その他の著者: | , , |
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science
903 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Graph-theoretic concepts in computer science, 20th International Workshop WG '94, Herrsching, Germany, June 16-18, 1994, proceedings, E.W. Mayr, Gunther Schmidt, Gottfried Tinhofer (eds), 1995, Berlin, Springer-Verlag, 1 vol. (IX-414 p.), Lecture notes in computer science, 3-540-59071-4 • Graph-Theoretic Concepts in Computer Science, Texte imprimé, 9783662164136 |
目次:
- 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 planarand 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.