Category:LNCS 1017

From BibNetWiki

Lecture Notes in Computer Science, Volume 1017

Articles in category "LNCS 1017"

There are 31 articles in this category.

A A Compact Data Structure and Parallel Algorithms for Permutation Graphs A Dynamic Algorithm for Line Graph Recognition A Uniform Approach to Graph Rewriting: The Pullback Approach An Approximation Algorithm for 3-Colourability C Chordal Graphs and their Clique Graphs Complexity and Approximability of Certain Bicriteria Location Problems D Diametral Path Graphs E Efficient Parallel Modular Decomposition F Finding and Counting Small Induced Subgraphs Efficiently G Graph-Theoretical Methods to Construct Entity-Relationship Databases

G cont. Graph-theoretic concepts in computer science: 21st International Workshop, WG '95, Aachen, Germany, June 20-22, 1995: proceedings H Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs Homogeneously Orderable Graphs and the Steiner Tree Problem Hot-Potato Routing on Multi-Dimensional Tori I Incremental Hive Graph M Modular Decomposition of Hypergraphs N NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems Non-Oblivious Local Search for Graph and Hypergraph Coloring Problems O On Devising Boolean Routing Schemes On Interval Routing Schemes and Treewidth On Termination of Graph Rewriting

O cont. On the Isomorphism of Graphs with Few P4s Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes P Partition Coefficients of Acyclic Graphs Planarization of Graphs Embedded on Surfaces S Searching for Faulty Leaves in Binary Trees Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem T The Malleability of TSP2Opt Toward a General Theory of Unicast-Based Multicast Communication V VC-Dimensions for Graphs Visualizing Two- and Three-Dimensional Models of Meristematic Growth