2294 search results - page 23 / 459 » From Path Graphs to Directed Path Graphs |
TCAD
2008
14 years 11 months ago
2008
Abstract--The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer-circuit design. High voltages that resulted from ESD might cause high cu...
DM
2008
14 years 11 months ago
2008
We study graph colorings avoiding periodic sequences with large number of blocks on paths. The main problem is to decide, for a given class of graphs F, if there are absolute const...
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
120
click to vote
APVIS
2009
15 years 28 days ago
2009
Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place the...
113
Voted
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...