2612 search results - page 80 / 523 » Switching Graphs and Their Complexity |
ICDE
2007
IEEE
14 years 11 months ago
2007
IEEE
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
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 ...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
CDC
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, we consider a multi-agent system consisting of mobile agents with second-order dynamics. The communication network is determined by a standard interaction rule based...
COMCOM
2004
13 years 10 months ago
2004
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...