default search action
Discrete Applied Mathematics, Volume 69
Volume 69, Number 1-2, August 1996
- Karl Nachtigall:
Periodic Network Optimization with Different Arc Frequencies. 1-17 - Meei Pyng Ng, Nicholas C. Wormald:
Reconstruction of Rooted Trees From Subtrees. 19-31 - Jeffrey Wood, John Shawe-Taylor
:
Representation Theory and Invariant Neural Networks. 33-60 - János Demetrovics, Vu Duc Thi:
Some Results About Normal Forms for Functional Dependency in the Relational Datamodel. 61-74 - Gregory Z. Gutin, Anders Yeo:
Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. 75-82 - Hyeong-Seok Lim, Jung-Heum Park
Embedding Trees in Recursive Circulants. 83-99 - Dennis Pixton:
Regularity of Splicing Languages. 101-124 - Peter W. Stephens:
Gap Strings and Spanning Forests for Bridge Graphs of Biconnected Graphs. 125-145 - Heping Zhang
The Clar Covering Polynomial of Hexagonal Systems I. 147-167 - V. Balachandhran, C. Pandu Rangan:
All-pairs-shortest-length on Strongly Chordal Graphs. 169-182 - Zhi-Zhong Chen, Xin He:
Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests. 183-198
Volume 69, Number 3, August 1996
- Carsten Flotow:
On Powers of Circular Arc Graphs and Proper Circular Arc Graphs. 199-207 - Kazuhisa Makino, Toshihide Ibaraki:
Interior and Exterior Functions of Boolean Functions. 209-231 - Lee Aaron Newberg:
The Number of Clone Orderings. 233-245 - Jing-Ho Yan, Jer-Jeong Chen, Gerard J. Chang:
Quasi-threshold Graphs. 247-255 - Jason I. Brown
The Complexity of Generalized Graph Colorings. 257-270 - Josep Fàbrega
Bipartite Graphs and Digraphs with Maximum Connectivity. 271-279 - Samir Khuller, Balaji Raghavachari, Neal E. Young
On Strongly Connected Digraphs with Bounded Cycle Length. 281-289
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-14 21:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: