Optimal constructions of event-node networks
Maciej M. Syslo (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “A note on minimum-dummy-activities PERT networks”
Optimal constructions of event-node networks
New proofs of the uniqueness of extremal noneven digraphs.
Lim, Chjan C., Van Patten, Gregory K. (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Randomly Eulerian digraphs
Gary Chartrand, Don R. Lick (1971)
Czechoslovak Mathematical Journal
Similarity:
Some remarks about digraphs with nonisomorphic - or -neighbourhoods
Halina Bielak, Elżbieta Soczewińska (1983)
Časopis pro pěstování matematiky
Similarity:
On (4, 2)-digraphs containing a cycle of length 2.
Iswadi, Hazrul, Baskoro, Edy Tri (2000)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
Sounaka Mishra, Kripasindhu Sikdar (2001)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We study hardness of approximating several minimaximal and maximinimal NP-optimization problems related to the minimum linear ordering problem (MINLOP). MINLOP is to find a minimum weight acyclic tournament in a given arc-weighted complete digraph. MINLOP is APX-hard but its unweighted version is polynomial time solvable. We prove that MIN-MAX-SUBDAG problem, which is a generalization of MINLOP and requires to find a minimum cardinality maximal acyclic subdigraph of a given digraph,...
A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs.
Chwe, Byoung-Song (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity: