A Technique for Improving Readability of Forrester Diagram in System Dynamics
Wei-Tzen Yang, Nai-Wen Kuo (2003)
The Yugoslav Journal of Operations Research
Similarity:
Displaying similar documents to “Issues in adaptive mesh refinement implementation.”
A Technique for Improving Readability of Forrester Diagram in System Dynamics
Visualization of the high level structure of the internet with Hermes.
Carmignani, Andrea, Di Battista, Giuseppe, Didimo, Walter, Matera, Francesco, Pizzonia, Maurizio (2002)
Journal of Graph Algorithms and Applications
Similarity:
On the cutting edge: simplified planarity by edge addition.
Boyer, John M., Myrvold, Wendy J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
The isogonal sponges on the cubic lattice.
Gillispie, Steven B., Grünbaum, Branko (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Airspace sectorization with constraints
Huy Trandac, Philippe Baptiste, Vu Duong (2005)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We consider the Airspace Sectorization Problem (ASP) in which airspace has to be partitioned into a given number of sectors, each of which being assigned to a team of air traffic controllers. The objective is to minimize the coordination workload between adjacent sectors while balancing the total workload of controllers. Many specific constraints, including both geometrical and aircraft related constraints are taken into account. The problem is solved in a constraint programming framework....
An efficient implementation of Sugiyama's algorithm for layered graph drawing.
Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael (2005)
Journal of Graph Algorithms and Applications
Similarity:
Avoiding Unstructured Workflows in Prerequisites Modeling
Boris Milašinović, Krešimir Fertalj (2012)
Computer Science and Information Systems
Similarity:
On the Vertex Separation of Maximal Outerplanar Graphs
Markov, Minko (2008)
Serdica Journal of Computing
Similarity:
We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability, of submops.
Planar maps as labeled mobiles.
Bouttier, J., Di Francesco, P., Guitter, E. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Counting triangulations of planar point sets.
Sharir, Micha, Sheffer, Adam (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: