Sciweavers

3204 search results - page 66 / 641
» The Alcuin Number of a Graph
Sort
View
MFCS
2009
Springer
14 years 2 months ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
MKM
2009
Springer
14 years 2 months ago
Exploring a Quantum Theory with Graph Rewriting and Computer Algebra
Graphical languages provide a powerful tool for describing the behaviour of quantum systems. While the use of graphs vastly reduces the complexity of many calculations [4,10], manu...
Aleks Kissinger
COCOON
2007
Springer
14 years 2 months ago
On the Hardness of Optimization in Power Law Graphs
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
Alessandro Ferrante, Gopal Pandurangan, Kihong Par...
BIRTHDAY
2005
Springer
14 years 1 months ago
Flexible Interconnection of Graph Transformation Modules
Modularization is a well-known concept to structure software systems as well as their specifications. Modules are equipped with export and import interfaces and thus can be connec...
Gregor Engels, Reiko Heckel, Alexey Cherchago
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
13 years 5 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...