Sciweavers

131 search results - page 23 / 27
» Orthogonal thickness of graphs
Sort
View
SOFTVIS
2003
ACM
14 years 18 days ago
A New Approach for Visualizing UML Class Diagrams
UML diagrams have become increasingly important in the engineering and reengineering processes for software systems. Of particular interest are UML class diagrams whose purpose is...
Carsten Gutwenger, Michael Jünger, Karsten Kl...
P2P
2009
IEEE
122views Communications» more  P2P 2009»
14 years 2 months ago
Virtual Direction Routing for Overlay Networks
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
DAC
2001
ACM
14 years 8 months ago
Circuit-based Boolean Reasoning
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
Andreas Kuehlmann, Malay K. Ganai, Viresh Paruthi
OOPSLA
2007
Springer
14 years 1 months ago
No ifs, ands, or buts: uncovering the simplicity of conditionals
Schematic tables are a new representation for conditionals. Roughly a cross between decision tables and data flow graphs, they represent computation and decision-making orthogona...
Jonathan Edwards
GD
2005
Springer
14 years 27 days ago
Incremental Connector Routing
Most diagram editors and graph construction tools provide some form of automatic connector routing, typically providing orthogonal or poly-line connectors. Usually the editor provi...
Michael Wybrow, Kim Marriott, Peter J. Stuckey