Non-planar network with edges subject to failure and enumeration of proper cuts
P. J. Doulliez, M. R. Rao (1973)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Adjacent vertices of the all 0-1 programming polytope”
Non-planar network with edges subject to failure and enumeration of proper cuts
Minimal size of a graph with diameter 2 and given maximal degree. II.
Znám, Š. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Neighbourhood tournaments
Bohdan Zelinka (1986)
Mathematica Slovaca
Similarity:
Even kernels.
Fraenkel, Aviezri (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Algorithms for Triangulating Polyhedra Into a Small Number of Tethraedra
Milica Stojanović (2005)
Matematički Vesnik
Similarity:
Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs.
Chen, Hon-Chan (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Maximal pentagonal packings.
Černý, A., Horák, P., Rosa, A., Znám, Š. (1996)
Acta Mathematica Universitatis Comenianae. New Series
Similarity: