Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    The visual computer 12 (1996), S. 173-180 
    ISSN: 1432-2315
    Keywords: Key words: Spanning line segments ; Skeletons ; Plane polyhedron intersections
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: P preserves the property of intersection; that is, a plane intersects P if and only if it also intersects ?. This paper gives a linear time algorithm for constructing ? for a polyhedron with N extreme vertices. If N is odd, the algorithm is optimal in yielding ⌊N/2⌋+1 spanning line segments. If N is even, it gives (N/2)+1, which is optimal in some cases and nearly optimal in others.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 9 (1993), S. 217-238 
    ISSN: 1432-0541
    Keywords: Circular arc graphs ; Interval graphs ; Consecutive ones property ; Parallel algorithm ; PRAM ; Claw-free graphs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present the first efficient parallel algorithms for recognizing some subclasses of circular arc graphs including γ circular arc graphs and proper interval graphs. These algorithms run in O(log2 n) time withO(n 3) processors on a CRCW PRAM. An intersection representation can also be constructed within the same resource bounds. Furthermore, we propose some new characterizations of Θ circular arc graphs and proper interval graphs.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    The visual computer 12 (1996), S. 173-180 
    ISSN: 1432-2315
    Keywords: Spanning line segments ; Skeletons ; Plane polyhedron intersections
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A set of spanning line segments ℊ in a polyhedronP preserves the property of intersection; that is, a plane intersectsP if and only if it also intersects ℊ. This paper gives a linear time algorithm for constructing ℊ for a polyhedron withN extreme vertices. IfN is odd, the algorithm is optimal in yielding [N/2] + 1 spanning line segments. IfN is even, it gives (N/2) + 1, which is optimal in some cases and nearly optimal in others.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Chichester, West Sussex : Wiley-Blackwell
    Mathematical Methods in the Applied Sciences 21 (1998), S. 883-894 
    ISSN: 0170-4214
    Keywords: solitary wave ; stability ; long wave-short wave resonance equations ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: This paper concerns the orbital stability for solitary waves of the Long Wave-Short Wave resonance equations. Since the abstract results of Grillakis et al. [7, 8] cannot be applied directly, we can extend the abstract stability theory and use the detailed spectral analysis to obtain the stability of the solitary waves. © 1998 B. G. Teubner Stuttgart - John Wiley & Sons, Ltd.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...