default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 80
Volume 80, Number 1, December 1997
- Victor Chepoi, Michel Deza, Viatcheslav P. Grishukhin:
Clin D'oeil on L1-embeddable Planar Graphs. 3-19 - Peter Dankelmann:
Average Distance and Domination Number. 21-35 - Curtis A. Barefoot, Roger C. Entringer, László A. Székely:
Extremal Values for Ratios of Distances in Trees. 37-56 - Martin Juvan, Bojan Mohar, Janez Zerovnik
:
Distance-related Invariants on Polygraphs. 57-71 - Sandi Klavzar, Ivan Gutman:
Wiener Number of Vertex-weighted Graphs and a Chemical Application. 73-81 - Wai Chee Shiu, Chong Sze Tong, Peter Che Bor Lam:
Wiener Number of Hexagonal Jagged-rectangles. 83-96 - Henry Martyn Mulder:
The Majority Strategy on Graphs. 97-105 - Lior Pachter:
Constructing Status Injective Graphs. 107-113 - Dominique Barth, Marie-Claude Heydemann:
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. 115 - Manuel Duque-Antón:
Constructing Efficient Simulated Annealing Algorithms. 115
Volume 80, Number 2-3, December 1997
- Randy Shull, Ann N. Trenk:
Cliques That Are Tolerance Digraphs. 119-134 - Maw-Shang Chang:
Weighted Domination of Cocomparability Graphs. 135-148 - Ginette Gauyacq:
Edge-forwarding Index of Star Graphs and Other Cayley Graphs. 149-160 - Christian Laforest:
Broadcast and Gossip in Line-communication Mode. 161-176 - Jian-Zhong Wang, Jixiang Meng:
The Exponent of the Primitive Cayley Digraphs on Finite Abelian Groups. 177-191 - Wei Sun, Yixian Yang:
Correlation Functions of a Family of Generalized Geometric Sequences. 193-201 - Cristian Calude, Sheng Yu:
Language-theoretic Complexity of Disjunctive Sequences. 203-209 - Irène Charon, Olivier Hudry, Frédéric Woirgard:
Note: A 16-vertex Tournament for Which Banks Set and Slater Set Are Disjoint. 211-215 - Anthony J. Macula:
Error-correcting Nonadaptive Group Testing with de-disjunct Matrices. 217-222 - Caterina De Simone, Michael Jünger:
On the Two-connected Planar Spanning Subgraph Polytope. 223-229 - Hiroshi Narushima, Masazumi Hanazawa:
A More Efficient Algorithm for MPR Problems in Phylogeny. 231-238 - K. Brooks Reid:
The k-ball l-path Branch Weight Centroid. 239-246 - Sylvain Gravier, Michel Mollard:
On Domination Numbers of Cartesian Product of Paths. 247-250 - Mikhail Y. Kovalyov:
Batch Scheduling and Common Due Date Assignment Problem: an NP-hard Case. 251-254 - Vassilis Giakoumakis, Irena Rusu:
Weighted Parameters in (P5, P5)-free Graphs. 255-261 - Colin McDiarmid:
A Doubly Cyclic Channel Assignment Problem. 263-268
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 2024-11-18 20:35 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:
