2294 search results - page 9 / 459 » From Path Graphs to Directed Path Graphs |
149
click to vote
ICCAD
1994
IEEE
15 years 8 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...
120
click to vote
TVCG
2011
14 years 11 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...
156
click to vote
ICALT
2006
IEEE
15 years 10 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...
132
click to vote
IWPEC
2004
Springer
15 years 9 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...
145
click to vote
STACS
2010
Springer
15 years 11 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( ...