Relevant bibliographies by topics / Graph Bisection

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Graph Bisection'

Author: Grafiati
Published: 3 June 2025
Last updated: 23 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graph Bisection.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Graph Bisection"

1

LEWIS, MARK, and GARY KOCHENBERGER. "GRAPH BISECTION MODELED AS CARDINALITY CONSTRAINED BINARY QUADRATIC TASK ALLOCATION." International Journal of Information Technology & Decision Making 12, no. 02 (2013): 261–76. http://dx.doi.org/10.1142/s0219622013500119.

Full text
Abstract:
In this paper, the cardinality constrained quadratic model for binary quadratic programming is used to model and solve the graph bisection problem as well as its generalization in the form of the task allocation problem with two processors (2-TAP). Balanced graph bisection is an NP-complete problem which partitions a set of nodes in the graph G = (N, E) into two sets with equal cardinality such that a minimal sum of edge weights exists between the nodes in the two separate sets. 2-TAP is graph bisection with the addition of node preference costs in the objective function. We transform the general linear k-TAP model to the cardinality constrained quadratic binary model so that it may be efficiently solved using tabu search with strategic oscillation. On a set of benchmark graph bisections, we improve the best known solution for several problems. Comparison results with the state-of-the-art graph partitioning program METIS, as well as Cplex and Gurobi are presented on a set of randomly generated graphs. This approach is shown to also work well with 2-TAP, comparing favorably to Cplex and Gurobi, providing better solutions in a much shorter time.
APA, Harvard, Vancouver, ISO, and other styles
2

Sotirov, Renata. "Graph bisection revisited." Annals of Operations Research 265, no. 1 (2017): 143–54. http://dx.doi.org/10.1007/s10479-017-2575-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Karpinski, Marek, Miroslaw Kowaluk, and Andrzej Lingas. "Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs." Fundamenta Informaticae 62, no. 3-4 (2004): 369–75. https://doi.org/10.3233/fun-2004-623-405.

Full text
Abstract:
The max-bisection problem is to find a partition of the vertices of a graph into two equal size subsets that maximizes the number of edges with endpoints in both subsets. We obtain new improved approximation ratios for the max-bisection problem on the low degree k-regular graphs for 3≤k≤8, by deriving some improved transformations from a maximum cut into a maximum bisection. In the case of three regular graphs we obtain an approximation ratio of 0.854, and in the case of four and five regular graphs, approximation ratios of 0.805, and 0.812, respectively.
APA, Harvard, Vancouver, ISO, and other styles
4

Hamann, Michael, and Ben Strasser. "Graph Bisection with Pareto Optimization." ACM Journal of Experimental Algorithmics 23 (November 15, 2018): 1–34. http://dx.doi.org/10.1145/3173045.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Saab, Y., and V. Rao. "On the graph bisection problem." IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications 39, no. 9 (1992): 760–62. http://dx.doi.org/10.1109/81.250179.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Clark, L. H., and R. C. Entringer. "The bisection width of cubic graphs." Bulletin of the Australian Mathematical Society 39, no. 3 (1989): 389–96. http://dx.doi.org/10.1017/s0004972700003300.

Full text
Abstract:
For a graph G, define the bisection width bw(G) of G as min { eG(A,B): {A,B} partitions V(G) with ‖A| − |B‖ ≤ 1 } where eG(A, B) denotes the number of edges in G with one end in A and one end in B. We show almost every cubic graph G of order n has bw(G) ≥ n/11 while every such graph has bw(G) ≤ (n + 138)/3. We also show that almost every r-regular graph G of order n has bw(G) ≥ crn where cr → r/4 as r → ∞. Our last result is asymtotically correct.
APA, Harvard, Vancouver, ISO, and other styles
7

Armbruster, Michael, Christoph Helmberg, Marzena Fügenschuh, and Alexander Martin. "On the Graph Bisection Cut Polytope." SIAM Journal on Discrete Mathematics 22, no. 3 (2008): 1073–98. http://dx.doi.org/10.1137/060675253.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jerrum, Mark, and Gregory B. Sorkin. "The Metropolis algorithm for graph bisection." Discrete Applied Mathematics 82, no. 1-3 (1998): 155–75. http://dx.doi.org/10.1016/s0166-218x(97)00133-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tu, Chih-Chien, and Hsuanjen Cheng. "Spectral methods for graph bisection problems." Computers & Operations Research 25, no. 7-8 (1998): 519–30. http://dx.doi.org/10.1016/s0305-0548(98)00021-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Poljak, Svatopluk, and Franz Rendl. "Nonpolyhedral Relaxations of Graph-Bisection Problems." SIAM Journal on Optimization 5, no. 3 (1995): 467–87. http://dx.doi.org/10.1137/0805024.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Graph Bisection"

1

Bui, Thang Nguyen. "Graph bisection algorithms." Thesis, Massachusetts Institute of Technology, 1986. http://hdl.handle.net/1721.1/77680.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1986.<br>MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.<br>Bibliography: leaves 64-66.<br>by Thang Nguyen Bui.<br>Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
2

Fügenschuh, Marzena. "Relaxations and solutions for the minimum graph bisection problem /." Berlin : Logos-Verl, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=3025314&prov=M&dok_var=1&dok_ext=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Schuster, Martin R. [Verfasser]. "Algorithms for minimum graph bisection and their performance on specific graph classes / Martin R. Schuster." Lübeck : Zentrale Hochschulbibliothek Lübeck, 2018. http://d-nb.info/1168433436/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Maki, Jameel A. "Some metaheuristics for the graph bisection and the multiconstraint knapsack problems." Thesis, University of East Anglia, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.399809.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Elsner, Ulrich. "Graph partitioning - a survey." Universitätsbibliothek Chemnitz, 2005. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200501047.

Full text
Abstract:
Many problems appearing in scientific computing and other areas can be formulated as a graph partitioning problems. Examples include data distribution for parallel computers, decomposition of sparse matrices and VLSI-design. In this survey we present the graph partitioning problem, describe some applications and introduce many of the algorithms used to solve the problem.
APA, Harvard, Vancouver, ISO, and other styles
6

Schmidt, Tina Janne [Verfasser], Peter [Akademischer Betreuer] [Gutachter] Gritzmann, Anusch [Gutachter] Taraz, and Christina G. [Gutachter] Fernandez. "On the Minimum Bisection Problem in Tree-Like and Planar Graphs : Structural and Algorithmic Results / Tina Janne Schmidt ; Gutachter: Peter Gritzmann, Anusch Taraz, Christina G. Fernandez ; Betreuer: Peter Gritzmann." München : Universitätsbibliothek der TU München, 2017. http://d-nb.info/1138359688/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fernandez, Luis Eduardo Zambrano. "Densidade local em grafos." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-15032019-114236/.

Full text
Abstract:
Nós consideramos o seguinte problema. Fixado um grafo H e um número real \\alpha \\in (0,1], determine o menor \\beta = \\beta(\\alpha, H) que satisfaz a seguinte propriedade: se G é um grafo de ordem n no qual cada subconjunto de [\\alpha n] vértices induz mais que \\beta n^2 arestas então G contém H como subgrafo. Este problema foi iniciado e motivado por Erdös ao conjecturar que todo grafo livre de triângulo de ordem n contém um subconjunto de [n/2] vértices que induz no máximo n^2 /50 arestas. Nosso resultado principal mostra que i) todo grafo de ordem n livre de triângulos e pentágonos contém um subconjunto de [n/2] vértices que induz no máximo n^2 /64 arestas, e ii) se G é um grafo regular de ordem n livre de triângulo, com grau excedendo n/3, então G contém um subconjunto de [n/2] vértices que induz no máximo n^2 /50 arestas. Se além disso G não é 3-cromático então G contém um subconjunto de [n/2] vértices que induz menos de n^2 /54 arestas. Como subproduto e confirmando uma conjectura de Erdös assintoticamente, temos que todo grafo regular de ordem n livre de triângulo com grau excedendo n/3 pode ser tornado bipartido pela omissão de no máximo (1/25 + o(1))n^2 arestas. Nós também fornecemos um contraexemplo a uma conjectura de Erdös, Faudree, Rousseau e Schelp.<br>We consider the following problem. Fixed a graph H and a real number \\alpha \\in (0,1], determine the smallest \\beta = \\beta(\\alpha, H) satisfying the following property: if G is a graph of order n such that every subset of [\\alpha n] vertices spans more that \\beta n^2 edges then G contains H as a subgraph. This problem was initiated and motivated by Erdös who conjectured that every triangle-free graph of order n contains a subset of [n/2] vertices that spans at most n^2 /50 edges. Our main result shows that i) every triangle- and pentagon-free graph of order n contains a subset of [n/2] vertices inducing at most n^2 /64 edges and, ii) if G is a triangle-free regular graph of order n with degree exceeding n/3 then G contains a subset of [n/2] vertices inducing at most n^2 /50 edges. Furthermore, if G is not 3-chromatic then G contains a subset of [n/2] vertices inducing less than n^2 /54 edges. As a by-product and confirming a conjecture of Erdös asymptotically, we obtain that every n-vertex triangle-free regular graph with degree exceeding n/3 can be made bipartite by removing at most (1/25 + o(1))n^2 edges. We also provide a counterexample to a conjecture of Erdös, Faudree, Rousseau and Schelp.
APA, Harvard, Vancouver, ISO, and other styles
8

Blini, Elvio A. "Biases in Visuo-Spatial Attention: from Assessment to Experimental Induction." Doctoral thesis, Università degli studi di Padova, 2016. http://hdl.handle.net/11577/3424480.

Full text
Abstract:
In this work I present several studies, which might appear rather heterogeneous for both experimental questions and methodological approaches, and yet are linked by a common leitmotiv: spatial attention. I will address issues related to the assessment of attentional asymmetries, in the healthy individual as in patients with neurological disorders, their role in various aspects of human cognition, and their neural underpinning, driven by the deep belief that spatial attention plays an important role in various mental processes that are not necessarily confined to perception. What follows is organized into two distinct sections. In the first I will focus on the evaluation of visuospatial asymmetries, starting from the description of a new paradigm particularly suitable for this purpose. In the first chapter I will describe the effects of multitasking in a spatial monitoring test; the main result shows a striking decreasing in detection performance as a function of the introduced memory load. In the second chapter I will apply the same paradigm to a clinical population characterized by a brain lesion affecting the left hemisphere. Despite a standard neuropsychological battery failed to highlight any lateralized attentional deficit, I will show that exploiting concurrent demands might lead to enhanced sensitivity of diagnostic tests and consequently positive effects on patients’ diagnostic and therapeutic management. Finally, in the third chapter I will suggest, in light of preliminary data, that attentional asymmetries also occur along the sagittal axis; I will argue, in particular, that more attentional resources appear to be allocated around peripersonal space, the resulting benefits extending to various tasks (i.e., discrimination tasks). Then, in the second section, I will follow a complementary approach: I will seek to induce attentional shifts in order to evaluate their role in different cognitive tasks. In the fourth and fifth chapters this will be pursued exploiting sensory stimulations: visual optokinetic stimulation and galvanic vestibular stimulation, respectively. In the fourth chapter I will show that spatial attention is highly involved in numerical cognition, this relationship being bidirectional. Specifically, I will show that optokinetic stimulation modulates the occurrence of procedural errors during mental arithmetics, and that calculation itself affects oculomotor behaviour in turn. In the fifth chapter I will examine the effects of galvanic vestibular stimulation, a particularly promising technique for the rehabilitation of lateralized attention disorders, on spatial representations. I will discuss critically a recent account for unilateral spatial neglect, suggesting that vestibular stimulations or disorders might indeed affect the metric representation of space, but not necessarily resulting in spatial unawareness. Finally, in the sixth chapter I will describe an attentional capture phenomenon by intrinsically rewarding distracters. I will seek, in particular, to predict the degree of attentional capture from resting-state functional magnetic resonance imaging data and the related brain connectivity pattern; I will report preliminary data focused on the importance of the cingulate-opercular network, and discuss the results through a parallel with clinical populations characterized by behavioural addictions.<br>In questo lavoro presenterò una serie di ricerche che possono sembrare piuttosto eterogenee per quesiti sperimentali e approcci metodologici, ma sono tuttavia legate da un filo conduttore comune: i costrutti di ragionamento e attenzione spaziale. Affronterò in particolare aspetti legati alla valutazione delle asimmetrie attenzionali, nell'individuo sano come nel paziente con disturbi neurologici, il loro ruolo in vari aspetti della cognizione umana, e i loro substrati neurali, guidato dalla convinzione che l’attenzione spaziale giochi un ruolo importante in svariati processi mentali non necessariamente limitati alla percezione. Quanto segue è stato dunque organizzato in due sezioni distinte. Nella prima mi soffermerò sulla valutazione delle asimmetrie visuospaziali, iniziando dalla descrizione di un nuovo paradigma particolarmente adatto a questo scopo. Nel primo capitolo descriverò gli effetti del doppio compito e del carico attenzionale su un test di monitoraggio spaziale; il risultato principale mostra un netto peggioramento nella prestazione al compito di detezione spaziale in funzione del carico di memoria introdotto. Nel secondo capitolo applicherò lo stesso paradigma ad una popolazione clinica contraddistinta da lesione cerebrale dell’emisfero sinistro. Nonostante una valutazione neuropsicologica standard non evidenziasse alcun deficit lateralizzato dell’attenzione, mostrerò che sfruttare un compito accessorio può portare ad una spiccata maggiore sensibilità dei test diagnostici, con evidenti ricadute benefiche sull'iter clinico e terapeutico dei pazienti. Infine, nel terzo capitolo suggerirò, tramite dati preliminari, che asimmetrie attenzionali possono essere individuate, nell'individuo sano, anche lungo l’asse sagittale; argomenterò, in particolare, che attorno allo spazio peripersonale sembrano essere generalmente concentrate più risorse attentive, e che i benefici conseguenti si estendono a compiti di varia natura (ad esempio compiti di discriminazione). Passerò dunque alla seconda sezione, in cui, seguendo una logica inversa, indurrò degli spostamenti nel focus attentivo in modo da valutarne il ruolo in compiti di varia natura. Nei capitoli quarto e quinto sfrutterò delle stimolazioni sensoriali: la stimolazione visiva optocinetica e la stimolazione galvanico vestibolare, rispettivamente. Nel quarto capitolo mostrerò che l’attenzione spaziale è coinvolta nella cognizione numerica, con cui intrattiene rapporti bidirezionali. Nello specifico mostrerò da un lato che la stimolazione optocinetica può modulare l’occorrenza di errori procedurali nel calcolo mentale, dall'altro che il calcolo stesso ha degli effetti sull'attenzione spaziale e in particolare sul comportamento oculomotorio. Nel quinto capitolo esaminerò gli effetti della stimolazione galvanica vestibolare, una tecnica particolarmente promettente per la riabilitazione dei disturbi attentivi lateralizzati, sulle rappresentazioni mentali dello spazio. Discuterò in modo critico un recente modello della negligenza spaziale unilaterale, suggerendo che stimolazioni e disturbi vestibolari possano sì avere ripercussioni sulle rappresentazioni metriche dello spazio, ma senza comportare necessariamente inattenzione per lo spazio stesso. Infine, nel sesto capitolo descriverò gli effetti di cattura dell’attenzione visuospaziale che stimoli distrattori intrinsecamente motivanti possono esercitare nell'adulto sano. Cercherò, in particolare, di predire l’entità di questa cattura attenzionale partendo da immagini di risonanza magnetica funzionale a riposo: riporterò dati preliminari focalizzati sull'importanza del circuito cingolo-opercolare, effettuando un parallelismo con popolazioni cliniche caratterizzate da comportamenti di dipendenza.
APA, Harvard, Vancouver, ISO, and other styles
9

Strite, Lisa. "A hybrid ant colony optimization algorithm for graph bisection /." 2001. http://emp3.hbg.psu.edu/theses/available/etd-12202001-102921/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Martin, Jacob Gilmore. "Singular value decomposition for information retrieval, graph bisection, and genetic algorithms." 2005. http://purl.galileo.usg.edu/uga%5Fetd/martin%5Fjacob%5Fg%5F200512%5Fphd.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Graph Bisection"

1

Jerrum, Mark. Simulated annealing for graph bisection. LFCS, Dept. of Computer Science, University of Edinburgh, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Some Meta-heuristics for the Graph Bisection and the Multi-constraint Knapsack Problems . University of East Anglia, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Graph Bisection"

1

Delling, Daniel, and Renato F. Werneck. "Better Bounds for Graph Bisection." In Algorithms – ESA 2012. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33090-2_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wagner, Dorothea, and Frank Wagner. "Between Min Cut and Graph Bisection." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57182-5_65.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

You, Kun, Bin Tang, Yifeng Chen, and Baoliu Ye. "On the Minimum Edge Bisection of Graph." In Lecture Notes in Computer Science. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-1090-7_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Delling, Daniel, Andrew V. Goldberg, Ilya Razenshteyn, and Renato F. Werneck. "Exact Combinatorial Branch-and-Bound for Graph Bisection." In 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics, 2012. http://dx.doi.org/10.1137/1.9781611972924.3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bezrukov, Sergei L., Robert Elsässer, Burkhard Monien, Robert Preis, and Jean-Pierre Tillich. "New Spectral Lower Bounds on the Bisection Width of Graphs." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-40064-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rolim, José, Ondrej Sýkora, and Imrich Vrt'o. "Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60618-1_80.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hanaka, Tesshu, Yasuaki Kobayashi, and Taiga Sone. "An Optimal Algorithm for Bisection for Bounded-Treewidth Graph." In Frontiers in Algorithmics. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59901-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Fernandes, Cristina G., Tina Janne Schmidt, and Anusch Taraz. "On the structure of graphs with large minimum bisection." In The Seventh European Conference on Combinatorics, Graph Theory and Applications. Scuola Normale Superiore, 2013. http://dx.doi.org/10.1007/978-88-7642-475-5_47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Mackenzie, Joel, Antonio Mallia, Matthias Petri, J. Shane Culpepper, and Torsten Suel. "Compressing Inverted Indexes with Recursive Graph Bisection: A Reproducibility Study." In Lecture Notes in Computer Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-15712-8_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Halperin, Eran, and Uri Zwick. "A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems." In Integer Programming and Combinatorial Optimization. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45535-3_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graph Bisection"

1

Bichot, Charles-Edmond. "Metaheuristics for graph bisection." In the 11th Annual conference. ACM Press, 2009. http://dx.doi.org/10.1145/1569901.1570169.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hamann, Michael, and Ben Strasser. "Graph Bisection with Pareto-Optimization." In 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611974317.8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dhulipala, Laxman, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergey Pupyrev, and Alon Shalita. "Compressing Graphs and Indexes with Recursive Graph Bisection." In KDD '16: The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2016. http://dx.doi.org/10.1145/2939672.2939862.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hwang, Inwook, Yong-Hyuk Kim, and Byung-Ro Moon. "Multi-attractor gene reordering for graph bisection." In the 8th annual conference. ACM Press, 2006. http://dx.doi.org/10.1145/1143997.1144188.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Boppana, Ravi B. "Eigenvalues and graph bisection: An average-case analysis." In 28th Annual Symposium on Foundations of Computer Science. IEEE, 1987. http://dx.doi.org/10.1109/sfcs.1987.22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Martin, Jacob G. "Spectral techniques for graph bisection in genetic algorithms." In the 8th annual conference. ACM Press, 2006. http://dx.doi.org/10.1145/1143997.1144193.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Defu, Yangzhou Chen, Hong Bi, and Zhuoxi Song. "Airspace Sectorization Based on Weighted Graph Spectral Bisection Algorithm." In The Twelfth COTA International Conference of Transportation Professionals. American Society of Civil Engineers, 2012. http://dx.doi.org/10.1061/9780784412442.196.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bui, T., C. Heigham, C. Jones, and T. Leighton. "Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms." In the 1989 26th ACM/IEEE conference. ACM Press, 1989. http://dx.doi.org/10.1145/74382.74527.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Talmaciu, Mihai, Elena Nechita, Barna Laszlo Iantovics, Enachescu Calin, and Florin Gheorghe Filip. "An Algorithm for the Bisection Problem on Trivially Perfect Graphs." In BICS 2008: Proceedings of the 1st International Conference on Bio-Inspired Computational Methods Used for Difficult Problems Solving: Development of Intelligent and Complex Systems. AIP, 2009. http://dx.doi.org/10.1063/1.3130633.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dubyk, Yaroslav, and Oleksii Ishchenko. "Application of the Williams-Wittrick Algorithm for Thin Shell Vibrations Problems." In ASME 2021 Pressure Vessels & Piping Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/pvp2021-62063.

Full text
Abstract:
Abstract This article presents adaptation of the Wittrick-Williams algorithm to calculate the natural vibration frequencies of cylindrical shells. Initially, the “algorithm” was proposed and used to find the natural frequencies of branched piping systems (trusses) in structural mechanics problems. We expanded it for shells, where a more difficult system of main differential equations is solved, with increasing calculation effort. The Wittrick-Williams algorithm was chosen to find vibration frequencies, because it is the only one exact solution for the transcendental eigenvalue problem. The “algorithm” gives the number of natural frequencies below a trial value of frequency, therefore, using bisection method, as the simplest, it is possible to find frequencies with sufficient accuracy. It can been used, for example, in a dynamic analysis, where it is important to find accurately the lower frequencies, and to distinguish between coupled frequencies. For solution the shell must been divided into a certain number of parts; convergence graphs are given, according to which the optimal number of partitions is selected. Obtained results show good convergence with experimental and literature data for different boundary conditions. Several special cases have been considered for shells with different values of elastic boundary conditions. The method has proven to be practical and can been used for modal, harmonic and seismic analysis.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Graph Bisection"

1

Bui, Thang, Christopher Heigham, Curt Jones, and Tom Leighton. Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada211914.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ponce, Colin, and Panayot S. Vassilevski. Solving Graph Laplacian Systems Through Recursive Bisections and Two-Grid Preconditioning. Office of Scientific and Technical Information (OSTI), 2016. http://dx.doi.org/10.2172/1240975.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Graph Bisection' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography