FAQ

Bitonic tour

Known as: Optimal bitonic tour 
In computational geometry, a bitonic tour of a set of point sites in the Euclidean plane is a closed polygonal chain that has each site as one of its… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1994-2017
012319942017

Related topics

Related topics

7 relations
Computational geometryInternational Olympiad in InformaticsIntroduction to AlgorithmsLexicographical order
(More)

Broader (1)

Dynamic programming

Related mentions per year

Related mentions per year

1937-2019
19401960198020002020
Bitonic tour
Dynamic programming
Travelling salesman problem
Computational geometry
Lexicographical order
Introduction to Algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Measuring power and energy consumption of programs running on kepler GPUs
Graphics processing units (GPUs) are becoming im-peccable choice for the upcoming exascale computing because of improvements in… (More)
  • table 1
  • table 2
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
Performance of the bitonic mergesort network on a Dataflow computer
High speed computing and growing amounts of data are driving the quest for ever faster sorting algorithms. Sorting networks… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Bitonic sorters of minimal depth
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 dlog(n)e − blog(n)c. 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
We give a systematic study of Hamiltonicity of grids—the graphs induced by finite subsets of vertices of the tilings of the plane… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Traveling Salesperson Problems for the Dubins Vehicle
In this paper, we study minimum-time motion planning and routing problems for the Dubins vehicle, i.e., a nonholonomic vehicle… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2008
2008
Guaranteeing Full Fault Coverage for UIO-based Testing Methods
This paper presents an analysis of the fault coverage provided by the UIO-based methods for testing communications protocols… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Multi-path Self-routing Switching Structure; by Interconnection of Multistage Sorting Concentrators
Several nonblocking packet switching architectures have been proposed for broadband network, such as shared bus, shared memory… (More)
  • figure 1
  • table I
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Review
2007
Review
2007
Reconstructing ‘ nature ’ as a picturesque theme park : the colonial case of Ireland
This paper explores how a form of visuality, the picturesque became the essential framework for the emergence of a theme park on… (More)
Is this relevant?
2007
2007
Flexible Guided-tours in Hypertexts : a Way of Controlling the User in Learning Applications
This paper proposes and discusses a user control strategy in learning applications which is based on the use of f lexible guided… (More)
  • figure 1
  • figure 2
Is this relevant?
1994
1994
Hypermedia Representations for Learning : Formal and Informal Observations on Designs and Directions
This paper focuses on issues of representation and interaction styles that are relevant considerations in the design and analysis… (More)
  • figure 1
  • figure 2
Is this relevant?