5100 search results - page 259 / 1020 » The Linear Complexity of a Graph |
166
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
152
click to vote
SMA
2009
ACM
15 years 10 months ago
2009
ACM
For designing aesthetic surfaces, such as the car bodies, it is very important to use aesthetic curves as characteristic lines. In such curves, the curvature should be monotonical...
146
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
237
click to vote
ISCA
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
137
click to vote
ICIP
2003
IEEE
16 years 6 months ago
2003
IEEE
This paper proposes a new method of designing finitesupport wavelet filters, based on minimization of energy in key parts of the frequency domain. In particular this technique is ...