4865 search results - page 189 / 973 » The Complexity of Graph Connectivity |
101
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— We discuss a framework for defining physical open systems on higher-dimensional complexes. We start with the formalization of the dynamics of open electrical circuits and the ...
249
Voted
ICDE
2007
IEEE
16 years 5 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...
154
click to vote
COMPGEOM
2010
ACM
15 years 8 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 ...
135
click to vote
SODA
2004
ACM
15 years 5 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...
138
click to vote
ICCD
2006
IEEE
15 years 9 months ago
2006
IEEE
Microfluidics-based biochips offer exciting possibilities for highthroughput sequencing, parallel immunoassays, blood chemistry for clinical diagnostics, DNA sequencing, and envir...