Relevant bibliographies by topics / Bipartit

Contents

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

Academic literature on the topic 'Bipartit'

Author: Grafiati
Published: 4 June 2021
Last updated: 12 February 2022

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 'Bipartit.'

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 "Bipartit"

1

Zulkarnaen, Ahmad Hunaeni. "Eksistensi Lembaga Kerjasama Bipartit dalam Perspektif Negara Kesejahteraan dan Hak Asasi Manusia." UNIFIKASI : Jurnal Ilmu Hukum 5, no. 1 (March 22, 2018): 45. http://dx.doi.org/10.25134/unifikasi.v5i1.787.

Full text
Abstract:
Abstrak : Negara Kesejahteraan Indonesia berdasarkan Pancasila dan Undang-Undang Dasar 1945 bertujuan memajukan kesejahteraan umum yang mengakui, menghormati dan melindungi hak asasi manusia. Tujuan penelitian ini, adalah untuk mengetahui dan menganalisis bagaimana korelasi antara negara kesejahteraan dengan HAM dalam perlindungan tenaga kerja?; dan bagaimana peran Lembaga Kerjasama Bipartit dalam memberikan perlindungan terhadap hak perkerja/buruh?. Metode penelitian yang digunakan adalah yuridis normative dengan spesifikasi penelitian deskriptif analitis. Hasil penelitian adalah salah satu sarana dalam hubungan industrial untuk menyampaikan pikiran dengan lisan atau tulisan adalah� Lembaga Kerjasama Bipartit, yaitu suatu forum komunikasi, konsultasi dan musyawarah antara wakil� �pekerja/buruh� �dan�� wakil� �pengusaha� �dalam suatu perusahaan� �guna� �membahas� �masalah Hubungan Industrial dan kondisi kerja pada umumnya. Kesimpulan, optimaliasi kinerja Lembaga Kerjasama Bipartit dengan tujuan menciptakan hubungan industrial yang harmonis, dinamis, dan berkeadilan demi kelangsungan hidup, pertumbuhan, perkembangan perusahaan, termasuk kesejahteraan pekerja/buruh dan keluarganya sekaligus sebagai sarana untuk mengkoordinasikan lembaga-lembaga ketenagakerjaan.Kata kunci: Hak Asasi Manusia, Lembaga Kerjasama Bipartit, Negara Kesejahteraan�THE BIPARTITE COOPERATION INSTITUTION OF EXISTENCE IN THE PERSPECTIVE OF THE WELFARE STATE AND HUMAN RIGHTS�Abstract : The Indonesian Welfare State based on Pancasila and the 1945 Constitution aims to advance the common welfare that recognizes, respects and protects human rights. The purpose of this study is to know and analyze how the correlation between the welfare state and human rights in labor protection; and how is the role of Bipartite cooperation institution in providing protection to workers / labor rights. The research method used is normative juridical with analytical descriptive specification. The result of the research is as a means in industrial relations to convey thoughts orally or written, this� is Bipartite cooperation institution, which is a communication forum, consultation and deliberation between worker/laborer representatives and employer's representative in a company to discuss industrial relations problem and working condition in general. Conclusion, optimizing the performance of Bipartite cooperation institution with the aim of creating harmonious, dynamic, and equitable industrial relations for the sake of survival, growth, development of the company, including the welfare of workers / laborers and also their families as well as a means to coordinate employment agencies.Keywords: Human Rights, Bipartite Cooperation Institution, Welfare State.
APA, Harvard, Vancouver, ISO, and other styles
2

Tiyas Vika Widyastuti, Gufron Irawan, and Anindita Dwi Hapsari. "Peranan Lembaga Kerjasama Bipartit Perusahaan di Kota Tegal Sebagai Upaya Pencegahan Perselisihan Hubungan Industrial." Diktum : Jurnal Ilmu Hukum 7, no. 1 (May 31, 2019): 82–96. http://dx.doi.org/10.24905/diktum.v7i1.71.

Full text
Abstract:
Perselisihan hubungan industrial dapat diminimalisir dengan berbagai pilihan media atau mekanisme sebagai upaya pencegahan perselisihan hubungan industrial.Salah satunya adalah dengan dibentuknya suatu forum komunikasi dan konsultasi yang keanggotaannya terdiri dari wakil pengusaha dan pekerja/buruh.Forum ini kemudian lebih sering disebut sebagai Lembaga kerjasama bipartit.Berbagai keunggulan karakteristik, peran dan fungsi yang dimiliki lembaga ini mempermudah bagi perusahaan dalam mencegah terjadinya perselisihan hubungan industrial.Namun sayangnya di dalam praktik, masih banyak perusahaan-perusahaan di Kota Tegal yang belum memiliki dan menerapkan lembaga kerjasama bipartit. Tujuan penelitian ini adalah untuk mengetahui dan menjelaskan tentang peranan lembaga kerjasama bipartit perusahaan di Kota Tegal sebagai upaya pencegahan perselisihan hubungan industrial serta untuk mengetahui dan menjelaskan faktor-faktor yang menyebabkan belum/tidak dibentuknya lembaga kerjasama bipartit perusahaan di Kota Tegal sebagai upaya pencegahan perselisihan hubungan industrial. Penelitian ini menggunakan pendekatan yuridis normatif, datanya sekunder berupa dokumen hukum, dan analisis datanya menggunakan alur berpikir deduktif. Hasil penelitian ini menunjukkan bahwa lembaga kerjasama bipartit perusahaan di Kota Tegal memiliki 3 (tiga) peranan yang berdampak positif pada kemajuan perusahaan-perusahaan yang sudah terdaftar memiliki lembaga kerjasama bipartit di Dinas Ketenagakerjaan setempat. Banyak faktor-faktor yang menyebabkan belum/tidak dibentuknya lembaga kerjasama bipartit perusahaan di Kota Tegal sebagai upaya pencegahan perselisihan hubungan industrial, salah satunya adalah kurang pahamnya pihak manajemen perusahaan dan buruh terkait adanya kewajiban membentuk lembaga kerjasama bipartit serta ketentuan sanksi administratif yang harus diterima jika melanggarnya.
APA, Harvard, Vancouver, ISO, and other styles
3

Mubarok, Muhammad Zakki. "EKSISTENSI BURUH DALAM KOMUNIKASI BIPARTIT (Upaya Membangun Kemitraan Antara Buruh dan Pengusaha Secara Ideal di Kota Kretek)." Jurnal Ilmiah Komunikasi Makna 6, no. 2 (May 7, 2018): 127. http://dx.doi.org/10.30659/jikm.6.2.127-139.

Full text
Abstract:
Hubungan industrial rentan memunculkan perselisihan, terutama antara pihak pengusaha dan buruh. Hal tersebut dikarenakan adanya perbedaan persepsi di antara kedua belah pihak. Sebelum perselisihan tersebut melabar, maka dibutuhkan komunikasi di tingkat internal perusahaan. Dalam perburuhan komunikasi tersebut biasa disebut dengan perundingan bipartit. Perundingan yang melibatkan pihak pengusaha, bisa manajemen atau yang mewakilinya, dengan pihak buruh, bisa serikat pekerja atau yang mewakilinya. Kudus sebagai kota industri, selama ini tidak terlihat adanya gejolak perselisihan dalam perburuhan yang mengarah kepada tindakan anarkis. Namun demikian bukan berarti lepas dari persilisihan sama sekali. Yang menjadi pertanyaan adalah apakah komunikasi bipartit dengan segala mekanismenya telah betul-betul dijalankan dalam dunia perburuhan di Kudus. Lantas sejauh manakah para buruh memahami peraturan dalam perundingan bipartit. Metode dalam penelitian ini menggunakan pendekatan fenomenologi, bertujuan untuk memperoleh gambaran secara utuh mengenai permasalahan-permasalahan yang terjadi di antara pengusaha dan buruh. Hasil dalam penelitian ini menunjukkan bahwa komunikasi di antara pengusaha dan buruh hampir tidak ada kendala kecuali faktor tingkat pendidikan buruh yang rendah. Hal tersebut kemudian dapat menimbulkan hambatan dalam memahami hubungan kondisional, cultural dan fungsional, meskipun sejatinya komunikasi berjalan lancar.Kata Kunci :� komunikasi, perundingan bipartit, hubungan industrial, perselisihan hubungan industrial
APA, Harvard, Vancouver, ISO, and other styles
4

Yuri, Resnita. "PENENTUAN RAINBOW CONNECTION NUMBER PADA HASIL OPERASI CARTESIAN PRODUCT TERHADAP GRAF LINGKARAN DAN GRAF BIPARTIT LENGKAP DENGAN GRAF LINTASAN." Jurnal Matematika UNAND 6, no. 1 (February 1, 2017): 148. http://dx.doi.org/10.25077/jmu.6.1.148-152.2017.

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

Rahman, Aulia, Muchammad Abrori, and Noor Saif Muhammad Musafi. "Penyelesaian Matching Graf Dengan Menggunakan Metode Hungarian dan Penerapannya Pada Penempatan Karyawan di Suatu Perusahaan." Jurnal Fourier 3, no. 2 (October 3, 2014): 75. http://dx.doi.org/10.14421/fourier.2014.32.75-89.

Full text
Abstract:
Semakin meningkatnya kompetisi global menuntut setiap perusahaan untuk meningkatkan kualitas serta efektifitas kinerja karyawannya yang pada akhirnya diharapkan dapat meningkatkan keuntungan. Penempatan sejumlah X karyawan pada Y pekerjaan dimana masing-masing karyawan mempunyai kompetensi untuk menyelesaikan semua pekerjaan dengan mempertimbangkan beberapa aspek seperti memaksimalkan keuntungan yang diperoleh atau meminimalkan waktu yang diperlukan sebagai akibat dari penempatan karyawan pada pekerjaan dikenal dengan Optimal Assignment Problem. Tujuan dari penulisan ini adalah untuk mencari solusi pada Optimal Assignment Problem dimana aspek yang akan dioptimalkan adalah keuntungan dari penempatan sejumlah karyawan pada pekerjaan yang dapat diperoleh dengan menerapkan konsep teori graf. Dalam hal ini permasalahan dinyatakan sebagai graf bipartit khususnya graf bipartit lengkap berbobot yang menerapkan konsep matching, yaitu pencarian matching sempurna dengan bobot paling optimal. Untuk mencari matching sempurna dengan bobot paling optimal maka dapat digunakan sebuah algoritma optimasi yaitu metode Hungarian. Dengan menggunakan metode Hungarian, diperoleh matching sempurna dengan bobot yang optimal pada graf bipartit lengkap berbobot. Matching dikatakan sempurna jika telah memenuhi semua himpunan simpul dan . Matching yang dihasilkan merupakan solusi dari Optimal Assignment Problem yakni memasangkan seorang karyawan tepat satu dengan sebuah pekerjaan dan bobotnya menyatakan keuntungan optimal yang akan diperoleh oleh suatu perusahaan.
APA, Harvard, Vancouver, ISO, and other styles
6

Persulessy, Elvinus R., and Abdul H. Mahmud. "RING PRIMA DAN RING SEMIPRIMA." BAREKENG: Jurnal Ilmu Matematika dan Terapan 7, no. 1 (March 1, 2013): 1–4. http://dx.doi.org/10.30598/barekengvol7iss1pp1-4.

Full text
Abstract:
Penelitian ini berfokus pada pelabelan super anti-ajaib dari graf planar tipe Akan ditunjukkan bahwa suatu kelas dari graf planar yang didefinisikan menggunakan graf lengkap dan suatu kelas dari graf planar yang didefinisikan menggunakan graf bipartit lengkap adalah dan super anti-ajaib dengan keadaan tertentu.
APA, Harvard, Vancouver, ISO, and other styles
7

Halim, Christian, Francis Y. Rumlawang, and Henry W. Patty. "PELABELAN SUPER MUKA ANTI-AJAIB PADA KELAS GRAF PLANAR." BAREKENG: Jurnal Ilmu Matematika dan Terapan 7, no. 1 (March 1, 2013): 5–8. http://dx.doi.org/10.30598/barekengvol7iss1pp5-8.

Full text
Abstract:
Penelitian ini berfokus pada pelabelan super anti-ajaib dari graf planar tipe Akan ditunjukkan bahwa suatu kelas dari graf planar yang didefinisikan menggunakan graf lengkap dan suatu kelas dari graf planar yang didefinisikan menggunakan graf bipartit lengkap adalah dan super anti-ajaib dengan keadaan tertentu.
APA, Harvard, Vancouver, ISO, and other styles
8

Sianturi, Ronald H., Theresia Simatupang, Mrs Rahmayanti, and Satria B. Hariandja. "PERLINDUNGAN HAK PEKERJA ASKES PASCA PEMBUBARAN PT ASKES (PERSERO)." Mimbar Hukum - Fakultas Hukum Universitas Gadjah Mada 26, no. 3 (February 8, 2015): 428. http://dx.doi.org/10.22146/jmh.16034.

Full text
Abstract:
This article discusses about the Askes Workers rights protection after `dissolution without liquidation of PT. Askes (Persero), which The Askes Workers turned to BPJS Kesehatan workers. This research is yuridis normative by using secondary data. The results showed that the workers’ rights protection after dissolution based on Law No.13 of 2003 and The Employment Agreement between Workers with PT. Askes (Persero). The workers’ rights changes in BPJS Kesehatan requires the worker approval. Industrial disputes can be resolved through bipartite mechanism, non-litigation and litigation. Artikel ini membahas tentang perlindungan hak pekerja Askes pasca pembubaran PT Askes (Persero) tanpa likuidasi dimana pekerja Askes beralih menjadi Pekerja BPJS Kesehatan. Penelitian ini bersifat yuridis normatif yang menggunakan data sekunder. Hasil penelitian menunjukkan bahwa perlindungan hak-hak pekerja Askes pasca pembubaran PT Askes (Persero) berdasarkan UU No. 13 Tahun 2003 dan Perjanjian Kerja antara Pekerja dengan PT Askes (Persero) dimana perubahan hak-hak pekerja memerlukan persetujuan dari Pekerja. Perselisihan hubungan industrial dapat timbul akibat pembubaran PT Askes (Persero) dapat diselesaikan melalui mekanisme bipartit, non litigasi maupun litigasi.
APA, Harvard, Vancouver, ISO, and other styles
9

Triyani, Triyani, and Niken Larasati. "PELABELAN TOTAL SISI TAK BERATURAN PADA GRAF GABUNGAN BIPARTIT LENGKAP." Jurnal Ilmiah Matematika dan Pendidikan Matematika 1, no. 2 (October 30, 2009): 59. http://dx.doi.org/10.20884/1.jmp.2009.1.2.2982.

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

Karuniawan, Dynna Madina, I Nyoman Putu Budiartha, and I Putu Gede Seputra. "Efektifitas Lembaga Bipartit Dalam Menyelesaikan Sengketa Hubungan Industrial Pada Perusahaan Pt. New Kuta Golf And Ocean View." Jurnal Konstruksi Hukum 1, no. 1 (August 27, 2020): 91–97. http://dx.doi.org/10.22225/jkh.1.1.2136.91-97.

Full text
Abstract:
The increasingly important demands of industrialization for the progress a country have consequences for employers to use effective systems wherever possible. However, industrial disputes between workers and employers are often a problem. Therefore we need a set of laws that can be a separate forum for dealing with dispute matters within a company, is Bipartite Cooperative. The problem raised in this paper is how the effectiveness of the Bipartite Institute and what are the things that hamper in resolving employment issues at PT New Kuta Golf and Ocean View. The research method used is an empirical legal research method through the sociology of law approach. The results obtained, that is about disputes that have occurred in the company namely working conditions, requirements of work, increased work productivity and welfare of workers who impact on the company. The form of settlement is done through Bipartite and termination of employment. The inhibiting factors found were weak mindset, limited information, lack of competent human resources towards understanding Bipartite.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Bipartit"

1

Lissel, Erik. "Korsningar i kompletta multipartita grafer." Thesis, Örebro universitet, Institutionen för naturvetenskap och teknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-35367.

Full text
Abstract:
Syftet med den här uppsatsen är att undersöka graden av planäritet för kompletta multipartita grafer. Det primära resultatet som presenteras är en formel som kan användas för att nedåt begränsa det minsta antalet korsningar som behövs för att realisera en komplett bipartit graf indelad i m respektive n noder: cr(K_{m,,n}) >= q - 2p + 4, m >= n >= 2, där q = mn och p = m + n. Därutöver presenteras tabeller som med formeln som utgångspunkt uppskattar eller bestämmer det minsta antalet korsningar för alla kompletta multipartita grafer med sju noder eller mindre.   Uppsatsen innehåller också en genomgång av några tidigare resultat, däribland Zarankiewicz uppställning av kompletta bipartita grafer samt en överblick över Crossing Number Inequality
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Ganqin. "Bipartite RankBoost+: An Improvement to Bipartite RankBoost." Case Western Reserve University School of Graduate Studies / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=case160767885657324.

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

Topart, Hélène. "Etude d’une nouvelle classe de graphes : les graphes hypotriangulés." Thesis, Paris, CNAM, 2011. http://www.theses.fr/2011CNAM0776/document.

Full text
Abstract:
Dans cette thèse, nous définissons une nouvelle classe de graphes : les graphes hypotriangulés. Les graphes hypotriangulés vérifient que pour tout chemin de longueur deux, il existe une arête ou un autre chemin de longueur deux entre ses extrémités. Cette classe permet par exemple de modéliser des réseaux robustes. En effet, nous montrons que dans de tels graphes, la suppression d'une arête ou d'un sommet ne modifie pas la distance initiale entre toutes paires de sommets non adjacents. Ensuite, nous étudions et démontrons plusieurs propriétés pour cette classe de graphes. En particulier, après avoir introduit une famille de partitions spécifiques, nous montrons les relations entre certains éléments de cette famille et leur caractère hypotriangulé. De plus, grâce à ces partitions, nous caractérisons les graphes hypotriangulés minimum, qui, parmi les graphes hypotriangulés connexes, minimisent le nombre d'arêtes pour un nombre de sommets fixés.Dans une deuxième partie, nous étudions la complexité, pour la classe des graphes hypotriangulés, de problèmes difficiles dans le cas général. Nous montrons d'abord que les problèmes classiques de cycle hamiltonien, coloration, clique maximum et stable maximum restent NP-difficiles pour cette classe de graphes. Ensuite, nous nous intéressons à des problèmes de modification de graphes, pour lesquels il s'agit de déterminer le nombre minimal d'arêtes à ajouter ou supprimer à un graphe pour obtenir un graphe hypotriangulé : nous montrons la complexité de ces problèmes pour plusieurs classes de graphes
In this thesis, we define a new class of graphs : the hypochordal graphs. These graphs satisfy that for any path of length two, there exists a chord or another path of length two between its two endpoints. This class can represent robust networks. Indeed, we show that in such graphs, in the case of an edge or a vertex deletion, the distance beween any pair of nonadjacent vertices remains unchanged. Then, we study several properties for this class of graphs. Especially, after introducing a family of specific partitions, we show the relations between some of these partitions and hypochordality. Moreover, thanks to these partitions, we characterise minimum hypochordal graph, that are, among connected hypochordal graphs, those that minimise the number of edges for a given number of vertices. In a second part, we study the complexity, for hypochordal graphs, of problems that are NP-hard in the general case. We first show that the classical problems of hamiltonian cycle, colouring, maximum clique and maximum stable set remain NP-hard for this class of graphs. Then, we analyse graph modification problems : deciding the minimal number of edges to add or delete from a graph, in order to obtain an hypochordal graph. We study the complexity of these problems for sevaral classes of graphs
APA, Harvard, Vancouver, ISO, and other styles
4

Kaihara, Marcelo E., 直史 高木, and Naofumi Takagi. "Bipartite Modular Multiplication." Springer, 2005. http://hdl.handle.net/2237/2751.

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

Helmberg, Christoph, Israel Rocha, and Uwe Schwerdtfeger. "A Combinatorial Algorithm for Minimizing the Maximum Laplacian Eigenvalue of Weighted Bipartite Graphs." Universitätsbibliothek Chemnitz, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-175057.

Full text
Abstract:
We give a strongly polynomial time combinatorial algorithm to minimise the largest eigenvalue of the weighted Laplacian of a bipartite graph. This is accomplished by solving the dual graph embedding problem which arises from a semidefinite programming formulation. In particular, the problem for trees can be solved in time cubic in the number of vertices.
APA, Harvard, Vancouver, ISO, and other styles
6

Bush, Albert. "Two Problems on Bipartite Graphs." Digital Archive @ GSU, 2009. http://digitalarchive.gsu.edu/math_theses/72.

Full text
Abstract:
Erdos proved the well-known result that every graph has a spanning, bipartite subgraph such that every vertex has degree at least half of its original degree. Bollobas and Scott conjectured that one can get a slightly weaker result if we require the subgraph to be not only spanning and bipartite, but also balanced. We prove this conjecture for graphs of maximum degree 3. The majority of the paper however, will focus on graph tiling. Graph tiling (or sometimes referred to as graph packing) is where, given a graph H, we find a spanning subgraph of some larger graph G that consists entirely of disjoint copies of H. With the Regularity Lemma and the Blow-up Lemma as our main tools, we prove an asymptotic minimum degree condition for an arbitrary bipartite graph G to be tiled by another arbitrary bipartite graph H. This proves a conjecture of Zhao and also implies an asymptotic version of a result of Kuhn and Osthus for bipartite graphs.
APA, Harvard, Vancouver, ISO, and other styles
7

Mighton, John 1957. "Knot theory on bipartite graphs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/NQ49930.pdf.

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

Saugmann, Pil Maria. "Frustration in a bipartite lattice." Licentiate thesis, Stockholms universitet, Fysikum, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-161721.

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

Crenshaw, Cameron M. "Edge-Transitive Bipartite Direct Products." VCU Scholars Compass, 2017. http://scholarscompass.vcu.edu/etd/4801.

Full text
Abstract:
In their recent paper ``Edge-transitive products," Hammack, Imrich, and Klavzar showed that the direct product of connected, non-bipartite graphs is edge-transitive if and only if both factors are edge-transitive, and at least one is arc-transitive. However, little is known when the product is bipartite. This thesis extends this result (in part) for the case of bipartite graphs using a new technique called "stacking." For R-thin, connected, bipartite graphs A and B, we show that A x B is arc-transitive if and only if A and B are both arc-transitive. Further, we show A x B is edge-transitive only if at least one of A, B is also edge-transitive, and give evidence that strongly suggests that in fact both factors must be edge-transitive.
APA, Harvard, Vancouver, ISO, and other styles
10

Lima, Murilo Santos de. "Aproximação de métricas finitas por métricas arbóreas e aplicações." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-13032012-201516/.

Full text
Abstract:
Muitos problemas de otimização em grafos, em especial problemas métricos, são mais fáceis de resolver em árvores. Portanto, uma estratégia para obter um bom algoritmo para certos problemas é obter uma árvore que aproxime o grafo, e utilizar uma solução do problema nessa árvore como uma solução aproximada para o problema no grafo original. Neste trabalho é estudada a técnica de Fakcharoenphol, Rao e Talwar, que mostraram como aproximar uma métrica finita arbitrária com n pontos por uma métrica numa árvore com distorção esperada O(lg n) -- o ótimo assintótico. Essa estratégia resulta em algoritmos de aproximação com boas razões de aproximação, e em algoritmos com bom fator de competitividade para diversos problemas de otimização online e distribuídos. É apresentada especificamente a aplicação da técnica ao problema do emparelhamento mínimo bipartido online, que ilustra como a aproximação de métricas auxilia na resolução de um problema e os cuidados que devem ser tomados nessa aplicação.
Many optimization problems on graphs, especially metric problems, are easier to solve on trees. Therefore, a strategy for obtaining a good algorithm for certain problems is to obtain a tree that approximates the graph, and use a solution of the problem on the tree as an approximate solution for the problem on the original graph. We study the work of Fakcharoenphol, Rao e Talwar, who showed how to approximate an arbitrary finite metric on n points by a tree metric with expected distortion O(lg n), which is asymptotically optimum. This strategy leads to algorithms with good approximation factors, and to competitive algorithms for various optimization problems, some of them online and distributed. Here, we present the application of that technique to the problem of finding a minimum online matching on a bipartite metric graph. This problem illustrates how metric approximation aids in solving a problem, and the care that must be taken when doing such an application.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Bipartit"

1

Kertonegoro, Sentanoe. Hubungan industrial: Hubungan antara pengusaha dan pekerja (bipartit) dan pemerintah (tripartit). Jakarta: Yayasan Tenaga Kerja Indonesia, 1999.

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

Indonesia. Departemen Tenaga Kerja dan Transmigrasi. Peraturan Menteri Tenaga Kerja dan Transmigrasi Republik Indonesia nomor Per. 31/Men/XII/2008 tentang pedoman penyelesaian perselisihan hubungan industrial melalui perundingan bipartit: Peraturan Menteri Tenaga Kerja dan Transmigrasi Republik Indonesia nomor Per. 32/Men/XII/2008 tentang tatacara pembentukan dan susunan keanggotaan lembaga kerja sama bipartit. Jakarta: Pusat Hubungan Masyarakat, Sekretariat Jenderal, Departemen Tenaga Kerja dan Transmigrasi RI, 2009.

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

Macedonia (Republic). Ministerstvo za kultura, ed. Macedonian bipartite writers. Skopje: St. Clement of Ohrid, National and University Library, 2011.

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

Asratian, Armen S. Bipartite graphs and their applications. Cambridge, U.K: Cambridge University Press, 1998.

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

Madrid, Spain) Seminario Euroiberoamericano sobre la Gestión Bipartita de la Formación Continua (1998. Gestión bipartita de la formación continua. Montevideo: Oficina Internacional del Trabajo, CINTERFOR, 1999.

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

Jan, Hus. Leccionarium bipartitum pars hiemalis. Pragae: Academia Scientiarum Bohemoslavaca, 1988.

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

Diálogos na sombra: Bispos e militares, tortura e justiça social na ditadura. [São Paulo, Brazil]: Companhia das Letras, 2001.

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

Jan, Hus. Magistri Iohannis Hus leccionarium bipartitum. Pragae: Academia, h.e. in aedibus Academiae Scientiarum Bohemoslovacae, 1988.

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

M, Kuzenzama K. P. La structure bipartite de Jn 6, 26-71: Nouvelle approche. Kinshasa: Faculté de théologie catholique, 1987.

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

Naumann, Michel. Les duels bipartites de la vie politique britannique. Paris: Ellipses, 2003.

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

Book chapters on the topic "Bipartit"

1

Lasanianos, Nick G., and Nikolaos K. Kanakaris. "Bipartite Patella." In Trauma and Orthopaedic Classifications, 453–55. London: Springer London, 2014. http://dx.doi.org/10.1007/978-1-4471-6572-9_104.

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

Ovchinnikov, Sergei. "Bipartite Graphs." In Universitext, 23–49. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-0797-3_2.

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

Schenck, R. C. "Bipartite Patella." In Current Orthopedic diagnosis & treatment, 20–21. London: Current Medicine Group, 2000. http://dx.doi.org/10.1007/978-1-4613-1107-2_11.

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

Nitzsche, Manfred. "Bipartite Graphen." In Graphen für Einsteiger, 101–21. Wiesbaden: Vieweg+Teubner Verlag, 2004. http://dx.doi.org/10.1007/978-3-322-92879-5_6.

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

Nevo, Eran. "Bipartite Rigidity." In Springer INdAM Series, 107–14. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-20155-9_20.

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

Simon, Klaus. "Bipartite Graphen." In Effiziente Algorithmen für perfekte Graphen, 97–147. Wiesbaden: Vieweg+Teubner Verlag, 1992. http://dx.doi.org/10.1007/978-3-322-94768-0_5.

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

Zepeda-Mendoza, Marie Lisandra, and Osbaldo Resendis-Antonio. "Bipartite Graph." In Encyclopedia of Systems Biology, 147–48. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-9863-7_1370.

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

Gasparyan, Grigor. "Bipartite Designs." In Integer Programming and Combinatorial Optimization, 23–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-69346-7_3.

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

Nitzsche, Manfred. "Bipartite Graphen." In Graphen für Einsteiger, 101–21. Wiesbaden: Vieweg+Teubner Verlag, 2005. http://dx.doi.org/10.1007/978-3-322-92380-6_6.

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

Nitzsche, Manfred. "Bipartite Graphen." In Graphen für Einsteiger, 109–31. Wiesbaden: Vieweg+Teubner, 2009. http://dx.doi.org/10.1007/978-3-8348-9968-2_6.

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

Conference papers on the topic "Bipartit"

1

Kolberg, Fabricio Schiavon, Marina Groshaus, André Luiz Pires Guedes, and Renato Carmo. "Results on Circular-Arc Bigraphs." In I Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2016.9846.

Full text
Abstract:
We present a series of results related to the structural properties of the bipartite graph class known as circular-arc bigraphs. We also propose the definition of a Helly circular-arc bigraph subclass, based on a concept known as bipartite-Helly, along with a few results related to its structural properties.
APA, Harvard, Vancouver, ISO, and other styles
2

Murata, Tsuyoshi. "Detecting Communities from Bipartite Networks Based on Bipartite Modularities." In 2009 International Conference on Computational Science and Engineering. IEEE, 2009. http://dx.doi.org/10.1109/cse.2009.81.

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

Tehrani, Arash Saber, Alexandros G. Dimakis, and Michael J. Neely. "Bipartite index coding." In 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6283853.

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

Miles, Brenda F., and Vir V. Phoha. "The bipartite clique." In the 43rd annual southeast regional conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1167350.1167385.

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

Zhou, Peng, Liang Du, and Xuejun Li. "Self-paced Consensus Clustering with Bipartite Graph." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/295.

Full text
Abstract:
Consensus clustering provides a framework to ensemble multiple clustering results to obtain a consensus and robust result. Most existing consensus clustering methods usually apply all data to ensemble learning, whereas ignoring the side effects caused by some difficult or unreliable instances. To tackle this problem, we propose a novel self-paced consensus clustering method to gradually involve instances from more reliable to less reliable ones into the ensemble learning. We first construct an initial bipartite graph from the multiple base clustering results, where the nodes represent the instances and clusters and the edges indicate that an instance belongs to a cluster. Then, we learn a structured bipartite graph from the initial one by self-paced learning, i.e., we automatically decide the reliability of each edge and involves the edges into graph learning in order of their reliability. At last, we obtain the final consensus clustering result from the learned bipartite graph. The extensive experimental results demonstrate the effectiveness and superiority of the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
6

Shah, Meet, Ibrahim Zeid, and Sagar Kamarthi. "Bipartite Graphical Integration of Dielectrophoresis Process Models for Assembly of Carbon Nanotubes." In ASME 2009 International Mechanical Engineering Congress and Exposition. ASMEDC, 2009. http://dx.doi.org/10.1115/imece2009-11977.

Full text
Abstract:
Dielectrophoresis is the process where nonuniform electric field causes the translational motion of uncharged, polarized particles. Recently dielectrophoresis has become the most widely used process in the field of nanomanufacturing as the translational motion of a carbon nanotube caused by the dielectrophoresis assembles it in the spacing between the electrodes. This process enables engineers to replace the traditional metal (copper or aluminum) wire with carbon nanotubes (CNTs) in the miniature electronic devices. Various process models have been developed and parametric studies have been carried out to understand the process better and to improve the quality and reliability of assembly of CNTs. We consolidate the scattered knowledge of the dielectrophoresis process and represent the integrated knowledge in the form of a complex network by connecting the process parameters based on the relationships they shares. We find that the bipartite relationships exist between some of the process parameters and we represent them in the form of bipartite graphs. We also represent these graphs as incidence matrices and verify whether each graph fulfills the condition of being bipartite. We apply the shortest path algorithm to find an even length path between the any two process parameters which turns out to be an efficient method to estimate the unknown state variables of the process and to access the real time state of the assembly process quickly and efficiently. One can also use bipartite graph to identify the non-contributing variables and eliminate the over constraint situation by applying Gauss elimination method.
APA, Harvard, Vancouver, ISO, and other styles
7

Ahmed, Nesreen, Nick Duffield, and Liangzhen Xia. "Sampling for Approximate Bipartite Network Projection." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/456.

Full text
Abstract:
Bipartite graphs manifest as a stream of edges that represent transactions, e.g., purchases by retail customers. Recommender systems employ neighborhood-based measures of node similarity, such as the pairwise number of common neighbors (CN) and related metrics. While the number of node pairs that share neighbors is potentially enormous, only a relatively small proportion of them have many common neighbors. This motivates finding a weighted sampling approach to preferentially sample these node pairs. This paper presents a new sampling algorithm that provides a fixed size unbiased estimate of the similarity matrix resulting from a bipartite edge stream projection. The algorithm has two components. First, it maintains a reservoir of sampled bipartite edges with sampling weights that favor selection of high similarity nodes. Second, arriving edges generate a stream of similarity updates, based on their adjacency with the current sample. These updates are aggregated in a second reservoir sample-based stream aggregator to yield the final unbiased estimate. Experiments on real world graphs show that a 10% sample at each stage yields estimates of high similarity edges with weighted relative errors of about 1%.
APA, Harvard, Vancouver, ISO, and other styles
8

Muhammad, Muhammad, and Stefanie Schwarz. "Bipartite Index coding Protocol." In 2014 7th Advanced Satellite Multimedia Systems Conference and the 13th Signal Processing for Space Communications Workshop (ASMS/SPSC). IEEE, 2014. http://dx.doi.org/10.1109/asms-spsc.2014.6934545.

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

Murata, Tsuyoshi. "Modularities for bipartite networks." In the 20th ACM conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1557914.1557956.

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

Moreira, Edré, Guilherme Oliveira Campos, and Wagner Meira Jr. "Dense Hierarchy Decomposition for Bipartite Graphs." In VII Symposium on Knowledge Discovery, Mining and Learning. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/kdmile.2019.8795.

Full text
Abstract:
Dense subgraphs detection is a well known problem in Computer Science. Hierarchical organization of graphs as dense subgraphs, however, goes beyond simple clustering as it allows the analysis of the network at different scales. Despite the fact there are several works on hierarchical decomposition for unipartite graphs, only a few works for the bipartite case have been proposed. In this work we explore the problem of hierarchical decomposition of bipartite graphs. We propose an algorithm which we call weighted linking that produces denser and more compact hierarchies. The proposed algorithm is evaluated experimentally using several datasets and provided gains on most of them.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Bipartit"

1

Zha, Hongyuan, Xiaofeng He, Chris Ding, Ming Gu, and Horst D. Simon. Bipartite graph partitioning and data clustering. Office of Scientific and Technical Information (OSTI), May 2001. http://dx.doi.org/10.2172/816202.

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

Kolda, Tamara G., Ali Pinar, and Sinan Aksoy. Measuring and Modeling Bipartite Graphs with Community Structure. Office of Scientific and Technical Information (OSTI), July 2016. http://dx.doi.org/10.2172/1561802.

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

Zimmermann, Christian, Xiadong Liu, Michael D. König, and Chih-Sheng Hsieh. Collaboration in Bipartite Networks, with an Application to Coauthorship Networks. Federal Reserve Bank of St. Louis, 2020. http://dx.doi.org/10.20955/wp.2020.030.

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

Gabow, Harold N., and Robert E. Tarjan. Almost-Optimum Parallel Speed-Ups of Algorithms for Bipartite Matching and Related Problems. Fort Belvoir, VA: Defense Technical Information Center, January 1989. http://dx.doi.org/10.21236/ada215111.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Bipartit' for particular source types:
Journal articles Dissertations / Theses Books
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