Sciweavers

1370 search results - page 42 / 274
» On grids in topological graphs
Sort
View
GCC
2003
Springer
14 years 3 months ago
Some Grid Automata for Grid Computing
We use 2-Dimensional language to construct 2-Dimensional computer graphics model, use MSO or other logics to specify some graph property, and use automata model checking technique ...
Hao Shen, Yongqiang Sun
ACL
2010
13 years 7 months ago
Entity-Based Local Coherence Modelling Using Topological Fields
One goal of natural language generation is to produce coherent text that presents information in a logical order. In this paper, we show that topological fields, which model high-...
Jackie Chi Kit Cheung, Gerald Penn
COMPGEOM
2010
ACM
14 years 2 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar
CONEXT
2009
ACM
13 years 11 months ago
Where the sidewalk ends: extending the internet as graph using traceroutes from P2P users
An accurate Internet topology graph is important in many areas of networking, from deciding ISP business relationships to diagnosing network anomalies. Most Internet mapping effor...
Kai Chen, David R. Choffnes, Rahul Potharaju, Yan ...
CAAN
2007
Springer
14 years 4 months ago
Improving Topological Routing in N2R Networks
Topological routing is basically table free, and allows for very fast restoration and thus a high level of reliability in communication. It has already been satisfactorily proposed...
José M. Gutiérrez López, Rub&...