Sciweavers

1199 search results - page 12 / 240
» Graph Theory
Sort
View
CORR
2010
Springer
137views Education» more  CORR 2010»
14 years 9 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
COMPGEOM
2004
ACM
15 years 2 months ago
The geometric thickness of low degree graphs
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
Christian A. Duncan, David Eppstein, Stephen G. Ko...
90
Voted
EUROMICRO
1996
IEEE
15 years 1 months ago
A Graph Rewriting Approach for Transformational Design of Digital Systems
Transformational design integrates design and verification. It combines "correctness by construciion" and design creativity by the use ofpre-proven behaviour preserving ...
Corrie Huijs
119
Voted
LION
2009
Springer
125views Optimization» more  LION 2009»
15 years 4 months ago
New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
Samuel Rota Bulò, Marcello Pelillo
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 4 months ago
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar