Gabow, H.N.: Efficient splitting off algorithms for graphs. In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, USA, Nov 1993, pp. Gabow, H.N.: A framework for cost-scaling algorithms for submodular flow problems. 16, 97–120 (1982)įrank, A.: A note on \(k\)-strongly connected orientations of an undirected graph. Paper 3.39, 38įrank, A.: An algorithm for submodular functions on graphs. Springer, New York (2013)įelsner, S., Schrezenmaier, H., Steiner, R.: Pentagon contact representations. (ed.) Thirty Essays on Geometric Graph Theory, pp. Research Paper 15įelsner, S.: Rectangle and square representations of planar graphs. 19, 248–264 (1972)Įhrlich, G.: Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. 11, 1277–1280 (1970)Įdmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems.
B 141, 105–114 (2020)ĭinits, E.A.: Algorithm for solution of a problem of maximum flow in a network with power estimation. Springer, Berlin (2016)Ĭreignou, N., Kröll, M., Pichler, R., Skritek, S., Vollmer, H.: A complexity theory for hard enumeration problems. 246, 22–37 (2018)Ĭonte, A., Grossi, R., Marino, A., Rizzi, R., Versari, L.: Directing Road Networks by Listing Strong Orientations, pp. thesis, Università di Pisa (2018)Ĭonte, A., Grossi, R., Marino, A., Rizzi, R.: Efficient enumeration of graph orientations with sources.
Order 10(4), 297–303 (1993)Ĭonte, A.: Enumeration algorithms for real-world networks: efficiency and beyond. Diploma thesis, FU Berlin (2000)īrightwell, G.: On the complexity of diagram testing.
thesis, Université de Lorraine (2019)īrehm, E.: 3-orientations and Schnyder-3-tree-decompositions. 72(1), 71–74 (1999)īlind, S.: Output-sensitive algorithms for enumeration problems in graphs. Graph Theory 87(3), 285–304 (2018)īarbosa, V.C., Szwarcfiter, J.L.: Generating all the acyclic orientations of an undirected graph. Springer, Cham (2019)īang-Jensen, J., Huang, J., Zhu, X.: Completing orientations of partially oriented graphs. (eds.) Graph-Theoretic Concepts in Computer Science, pp.
Aichholzer, O., Cardinal, J., Huynh, T., Knauer, K., Mütze, T., Steiner, R., Vogtenhuber, B.: Flip distances between graph orientations.
0 kommentar(er)
