Sciweavers

1199 search results - page 66 / 240
» Graph Theory
Sort
View
139
Voted
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 3 months ago
On Graph Crossing Number and Edge Planarization
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
Julia Chuzhoy, Yury Makarychev, Anastasios Sidirop...
108
Voted
ISMB
1993
15 years 5 months ago
Grammatical Formalization of Metabolic Processes
In the field of biotechnologyand medicineit is of interest to modeland simulate metabolicprocesses. The usual methods to model metabolic pathwaysare chemicaldescriptions anddiffer...
Ralf Hofestädt
126
Voted
FORTE
2008
15 years 5 months ago
Program Repair Suggestions from Graphical State-Transition Specifications
In software engineering, graphical formalisms, like state-transition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads t...
Farn Wang, Chih-Hong Cheng
125
Voted
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
15 years 7 months ago
An ant-based algorithm for finding degree-constrained minimum spanning tree
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
Thang Nguyen Bui, Catherine M. Zrncic
155
Voted
JCO
2006
126views more  JCO 2006»
15 years 3 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li