2294 search results - page 9 / 459 » From Path Graphs to Directed Path Graphs |
ICCAD
1994
IEEE
14 years 1 months ago
1994
IEEE
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
TVCG
2011
13 years 3 months ago
2011
—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 t...
ICALT
2006
IEEE
14 years 3 months ago
2006
IEEE
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
IWPEC
2004
Springer
14 years 2 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...