Suchergebnisse - Discrete mathematics—Graph algorithms General Terms

Lovász-Type Theorems and Game Comonads von Dawar, Anuj, Jakl, Tomas, Reggio, Luca

“… As special cases of this general theorem, we obtain two variants of Lovász' theorem: the result by Dvořák (2010) that characterises equivalence of graphs in the k …”
Volltext

Revisiting Resolution and Inter-Layer Coupling Factors in Modularity for Multilayer Networks von Amelio, Alessia, Tagarelli, Andrea

“… Modularity for multilayer networks, also called multislice modularity, is parametric to a resolution factor and an inter-layer coupling factor. The former is …”
Volltext

On the general false path problem in timing analysis von Du, D. H., Yen, S. H., Ghanta, S.

“… We present an efficient algorithm for solving the general false path problem. We also propose another algorithm which generates all the possible sensitizable paths with the delays greater than a given threshold …”
Volltext

Optimal non-uniform wire-sizing under the Elmore delay model von Chen, Chung-Ping, Zhou, Hai, Wong, D. F.

“… Experimental results show that our algorithms are efficient both in terms of runtime and storage …”
Volltext

Optimum reduction of programmable logic array von Hu, T. C., Kuo, Y. S.

“… A heuristic algorithm with error bound is given for a general bipartite graph. A new graph model is introduced …”
Volltext

A data structure for circuit net lists von Meyer, Steve

“… It adds separate structures (arrays) for cell type and I/O pad specific information, stores net lists defined in terms of primitive elements or cells as two superimposed symmetric incidence list form directed graphs, and separates …”
Volltext

Minplex-a compactor that minimizes the bounding rectangle and individual rectangles in a layout von Lin, Sching L., Allen, Jonathan

“… This approach provides a general and rigorous method for wire-length minimization. Algorithms for generating and solving the constraint graph are proposed …”
Volltext