Abstract The large computational cost and memory requirement for the finite difference frequency domain (FDFD) method limit its applications in seismic wave simulation, especially models. For conventional FDFD methods, discretisation based on minimum model velocity leads to oversampling high-velocity regions. To reduce of method, we propose a trapezoid-grid scheme improve efficiency modeling. a...

Within the framework of continuous and multiresources cumulative constraints, a task T expresses a piecewise linear resource function and is represented by a sequence of p contiguous trapezoid sub-tasks with variable durations and heights. In this context, this paper provides an algorithm in O(p) for filtering the resource assignment and the temporal attributes of such a task, according to a tr...

Reliability of networks is an important issue in the field of graph and network. Computation of network vulnerability parameters is NP-complete for popular network topologies such as tree, Mesh, Cube, etc.In this paper, we will show that the tenacity and rupture degree parameters for trapezoid graphs can be computed in polynomial time.

The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability graphs of partially ordered sets with interval dimension 2 and height 3. In contrast, the problem is known to be solvable in polynomial time for comparabilit...

In this paper, we first obtain prove two new identities for the quantum integrals. Then establish Trapezoid and Midpoint type inequalities integrals defined by Bermudo et al. in [3]. The study generalize some results obtained earlier works