default search action
Discrete Applied Mathematics, Volume 73
Volume 73, Number 1, February 1997
- Juha Honkala:
A Decision Method for Parikh Slenderness of Context-free Languages. 1-4 - Heping Zhang
, Fuji Zhang:
The Rotation Graphs of Perfect Matchings of Plane Bipartite Graphs. 5-12 - Giorgio Gambosi, Marco Protasi, Maurizio Talamo
Preserving Approximation in the Min-Weighted Set Cover Problem. 13-22 - Avraham A. Melkman
A Note on Approximate Inclusion-exclusion. 23-26 - Leizhen Cai, Baruch Schieber:
A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph. 27-34 - Kathleen Romanik:
Directed Rectangle-visibility Graphs Have Unbounded Dimension. 35-39 - Luke O'Connor:
Nondegenerate Functions and Permutations. 41-57 - Huaxiao Zhang, Fuji Zhang, Qiongxiang Huang:
On the Number of Spanning Trees and Eulerian Tours in Iterated Line Diagraphs. 59-67 - Béla Bollobás, Graham R. Brightwell:
Random Walks and Electrical Resistances in Products of Graphs. 69-79 - Vasek Chvátal:
Resolution Search. 81-99
Volume 73, Number 2, March 1997
- Wai Chee Shiu, Peter Che Bor Lam:
The Wiener Number of the Hexagonal Net. 101-111 - Wen-Chung Huang, Bo-Yin Yang, Yeong-Nan Yeh:
From Ternary Strings to Wiener Indices of Benzenoid Chains. 113-131 - Yung-Ling Lai, Kenneth Williams:
On Bandwidth for the Tensor Product of Paths and Cycles. 133-141 - John D. Lamb
Bond Graphs II: Causality and Singularity. 143-173 - Victor Chepoi:
Peakless Functions on Graphs. 175-189
Volume 73, Number 3, March 1997
- Ryan B. Hayward:
Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability. 199-210 - John D. Lamb
Bond Graphs III: Bond Graphs and Electrical Networks. 211-250 - Ian Parberry:
An Efficient Algorithm for the Knight's Tour Problem. 251-260 - Maiko Shigeno, Satoru Iwata:
A Cost-scaling Algorithm for 0-1 Submodular Flows. 261-273 - Fuji Zhang, Heping Zhang:
A Note on the Number of Perfect Matchings of Bipartite Graphs. 275-282 - Asoo J. Vakharia, Bülent Çatay:
Two Machine Openshop Scheduling with Machine-dependent Processing Times. 283-288 - Arkady A. Chernyak, Zhanna A. Chernyak:
Note on Complexity of Computing the Domination of Binary Systems. 289-295
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: