Graph-Theoretic Concepts in Computer Science

We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicographic order provides nested solutions for the EIP. We present several new classes of such graphs that include as special cases all presently known graphs with this property. Our new results are applied to derive best possible edge-isoperimetric inequalities for the cartesian powers of arbitrary regular, resp. regular bipartite, graphs with a high density.

[1]  Piotr Indyk,et al.  Fast estimation of diameter and shortest paths (without matrix multiplication) , 1996, SODA '96.

[2]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[3]  Hazel Everett,et al.  Recognizing Visibility Graphs of Spiral Polygons , 1990, J. Algorithms.

[4]  Lenore Cowen,et al.  Near-linear cost sequential and distributed constructions of sparse neighborhood covers , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[5]  Feodor F. Dragan,et al.  The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings , 1994, Discret. Appl. Math..

[6]  Sridhar Radhakrishnan,et al.  Unified All-pairs Shortest Path Algorithms in the Chordal Hierarchy , 1997, Discret. Appl. Math..

[7]  Noga Alon,et al.  On the Exponent of the All Pairs Shortest Path Problem , 1991, J. Comput. Syst. Sci..

[8]  Feodor F. Dragan,et al.  A Note on Distance Approximating Trees in Graphs , 2000, Eur. J. Comb..

[9]  Feodor F. Dragan,et al.  Distance Approximating Trees for Chordal and Dually Chordal Graphs , 1999, J. Algorithms.

[10]  Prakash Mirchandani.  A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph , 1996, Networks.

[11]  Rajeev Motwani,et al.  Perfect Graphs and Orthogonally Convex Covers , 1989, SIAM J. Discret. Math..

[12]  Elias Dahlhaus.  Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes , 1992, WG.

[13]  Feodor F. Dragan,et al.  Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS , 1999, Discret. Appl. Math..

[14]  Rajeev Motwani,et al.  Covering orthogonal polygons with star polygons: the perfect graph approach , 1988, SCG '88.

[15]  D. T. Lee,et al.  An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications , 1993, ESA.

[16]  C. Pandu Rangan,et al.  All-pairs-shortest-length on Strongly Chordal Graphs , 1996, Discret. Appl. Math..

[17]  R. Motwani,et al.  On Diameter Verification and Boolean Matrix Multiplication. , 1995 .

[18]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[19]  Jou-Ming Chang,et al.  Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs , 1999, Inf. Process. Lett..

[20]  Lin Chen.  Solving the Shortest-Paths Problem on Bipartite Permutation Graphs Efficiently , 1995, Inf. Process. Lett..

[21]  Jeremy P. Spinrad,et al.  Doubly Lexical Ordering of Dense 0 - 1 Matrices , 1993, Inf. Process. Lett..

[22]  C. Pandu Rangan,et al.  An optimal algorithm to solve the all-pair shortest path problem on interval graphs , 1992, Networks.

[23]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[24]  R. Sridhar,et al.  Efficient Algorithms for Shortest Distance Queries on Special Classes of Polygons , 1995, Theor. Comput. Sci..

[25]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[26]  S. Olariu,et al.  On the semi-perfect elimination , 1988 .

[27]  Anna Lubiw,et al.  Doubly Lexical Orderings of Matrices , 1987, SIAM J. Comput..

[28]  Uri Zwick,et al.  All-Pairs Almost Shortest Paths , 1997, SIAM J. Comput..