Search results for "girth"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
71	Olgica Milenkovic, Navin Kashyap, David Leyba	Shortened Array Codes of Large Girth.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
71	Thomas P. Hayes	Randomly coloring graphs of girth at least five.	STOC	2003	DBLP DOI BibTeX RDF	Glauber dynamics, concentration inequalities, posterior analysis, graph coloring, Markov chain Monte Carlo, Chernoff bounds
69	Jun Wu, Xiaolin Tian 0001	An Algorithm Based on Girth-location for MR Head Image Segmentation.	BMEI (2)	2008	DBLP DOI BibTeX RDF	Girth-Location, connective areas, MR Head Image, Image Segmentation
57	Mostafa Esmaeili, Mehdi Gholami	Geometrically-structured maximum-girth LDPC block and convolutional codes.	IEEE J. Sel. Areas Commun.	2009	DBLP DOI BibTeX RDF
57	Xiaofu Wu, Xiaohu You 0001, Chunming Zhao	A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes.	IEEE Trans. Commun.	2008	DBLP DOI BibTeX RDF
57	Sunghwan Kim, Jong-Seon No, Habong Chung, Dong-Joon Shin	Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than 12.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
57	Mark E. O'Sullivan	Algebraic construction of sparse matrices with large girth.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
55	Weiting Cao, Michael J. Pelsmajer	The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Toughness, Toroidal graph, Connectivity, Girth
54	Hossein Hajiabolhassan, Xuding Zhu	Sparse H-Colourable Graphs of Bounded Maximum Degree.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Uniquely H-colourable graphs, Bounded maximum degree, Girth
54	Noga Alon, Ayal Zaks	Algorithmic Aspects of Acyclic Edge Colorings.	Algorithmica	2002	DBLP DOI BibTeX RDF	Acyclic edge coloring, Girth
51	Angie Westover-Muñoz, David Landsbergen, Amanda M. Girth	Citizen Engagement in Technically Dynamic Environments.	EGOV-CeDEM-ePart-*	2020	DBLP BibTeX RDF
43	Jin Lu 0002, José M. F. Moura	TS-LDPC Codes: Turbo-Structured Codes With Large Girth.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
43	Reinhard Diestel, Christof Rempel	Dense Minors In Graphs Of Large Girth.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05C83
43	Bane Vasic, Karunakar Pedagani, Milos Ivkovic	High-rate girth-eight low-density parity-check codes on rectangular integer lattices.	IEEE Trans. Commun.	2004	DBLP DOI BibTeX RDF
43	William Klostermeyer, Cun-Quan Zhang	n-Tuple Coloring of Planar Graphs with Large Odd Girth.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
43	Hristo N. Djidjev	Computing the Girth of a Planar Graph.	ICALP	2000	DBLP DOI BibTeX RDF
43	L. Sunil Chandran	A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles.	FSTTCS	1999	DBLP DOI BibTeX RDF
43	Wolfgang Mader 0001	Topological Subgraphs in Graphs of Large Girth.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C35
42	Spyros C. Kontogiannis, Paul G. Spirakis	Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach.	MFCS	2007	DBLP DOI BibTeX RDF
42	Jan Kratochvíl, Martin Pergel	Geometric Intersection Graphs: Do Short Cycles Help?	COCOON	2007	DBLP DOI BibTeX RDF
42	Antar Bandyopadhyay, David Gamarnik	Counting without sampling: new algorithms for enumeration problems using statistical physics.	SODA	2006	DBLP DOI BibTeX RDF
42	Giulio Colavolpe, Gianpietro Germi	On the application of factor graphs and the sum-product algorithm to ISI channels.	IEEE Trans. Commun.	2005	DBLP DOI BibTeX RDF
40	Ravindra S. Goonetilleke, Channa P. Witana, Jianhui Zhao 0001, Shuping Xiong	The Pluses and Minuses of Obtaining Measurements from Digital Scans.	HCI (11)	2009	DBLP DOI BibTeX RDF	foot, brannock, measurement, registration, alignment, Scanning, width, girth
40	Genjiu Xu, Xueliang Li 0001, Shenggui Zhang	The Binding Number of a Digraph.	CJCDGCGT	2005	DBLP DOI BibTeX RDF	Binding number, Caccetta-Häggkvist Conjecture, directed graph, girth
30	György Kiss, Stefko Miklavic, Tamás Szonyi	A stability result for girth-regular graphs with even girth.	J. Graph Theory	2022	DBLP DOI BibTeX RDF
30	Farzane Amirzade, Mohammad-Reza Sadeghi 0001	Analytical Lower Bounds on the Size of Elementary Trapping Sets of Variable-Regular LDPC Codes With Any Girth and Irregular Ones With Girth 8.	IEEE Trans. Commun.	2018	DBLP DOI BibTeX RDF
30	Farzane Amirzade, Mohammad-Reza Sadeghi 0001	Analytical lower bounds for the size of elementary trapping sets of variable-regular LDPC codes with any girth and irregular ones with girth 8.	CoRR	2017	DBLP BibTeX RDF
30	Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano 0001, Julián Salas	On the λ′-optimality in graphs with odd girth g and even girth h.	Appl. Math. Lett.	2011	DBLP DOI BibTeX RDF
30	Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano 0001	Superconnectivity of graphs with odd girth g and even girth h.	Discret. Appl. Math.	2011	DBLP DOI BibTeX RDF
30	Judit Nagy-György	Online coloring graphs with high girth and high odd girth.	Oper. Res. Lett.	2010	DBLP DOI BibTeX RDF
30	Luis Pedro Montejano 0001, Camino Balbuena, Pedro García-Vázquez	On the Superconnectivity in graphs with odd girth g and even girth h.	Electron. Notes Discret. Math.	2009	DBLP DOI BibTeX RDF
30	Hua Chen, Zhigang Cao	A Measure of the Girth Histogram for Improved Girth-Conditioning Construction of LDPC Codes.	IEEE Commun. Lett.	2007	DBLP DOI BibTeX RDF
29	Mohsen Bayati, Andrea Montanari, Amin Saberi	Generating random graphs with large girth.	SODA	2009	DBLP DOI BibTeX RDF
29	Oren Weimann, Raphael Yuster	Computing the Girth of a Planar Graph in O(n logn) Time.	ICALP (1)	2009	DBLP DOI BibTeX RDF
29	Flavio Chierichetti, Andrea Vattani	The Local Nature of List Colorings for Graphs of High Girth.	ICALP (1)	2008	DBLP DOI BibTeX RDF
29	Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu	From High Girth Graphs to Hard Instances.	CP	2008	DBLP DOI BibTeX RDF
29	John Craddock, Mark F. Flanagan, Stephen James Redmond, Anthony D. Fagan	Construction of Girth 8 LDPC Codes based on Multidimensional Finite Lattices.	ISCC	2007	DBLP DOI BibTeX RDF
29	Sunghwan Kim, Jong-Seon No, Habong Chung, Dong-Joon Shin	On the girth of tanner (3, 5) quasi-cyclic LDPC codes.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
29	Lap Chi Lau, Michael Molloy 0001	Randomly Colouring Graphs with Girth Five and Large Maximum Degree.	LATIN	2006	DBLP DOI BibTeX RDF
29	Natalia Oksimets	Euler Tours of Maximum Girth in K2n+1 and K2n, 2n.	Graphs Comb.	2005	DBLP DOI BibTeX RDF
29	Zhishi Pan, Xuding Zhu	Graphs of Large Girth with Prescribed Partial Circular Colourings.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	Mathematical Subject Classification 05C15
29	Martin Kochol	Girth restrictions for the 5-flow conjecture.	SODA	2005	DBLP BibTeX RDF
29	Yair Glasner	Ramanujan Graphs with Small Girth.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05Cxx, 05C25, 22E40
29	Xuechao Li, Rong Luo	Edge Coloring of Embedded Graphs with Large Girth.	Graphs Comb.	2003	DBLP DOI BibTeX RDF	Edge chromatic number, Euler contribution, Edge coloring
29	Michael Molloy 0001	The Glauber dynamics on colourings of a graph with high girth and maximum degree.	STOC	2002	DBLP DOI BibTeX RDF	rapidly mixing, Markov chain
29	Nathan Linial, Avner Magen, Assaf Naor	Girth and euclidean distortion.	STOC	2002	DBLP DOI BibTeX RDF	EUCLID
29	Wolfgang Mader 0001	Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C83, 05C35
29	Yoshiharu Kohayakawa, Bernd Kreuter, Angelika Steger	An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05A16, 05C35, 05C38, 05C80
28	Shu-Tao Xia, Fang-Wei Fu 0001	Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
28	Keke Liu, Zesong Fei, Jingming Kuang 0001	Three algebraic methods for constructing nonbinary LDPC codes based on finite fields.	PIMRC	2008	DBLP DOI BibTeX RDF
28	Sikyung Kim, Mohammad Mynuddin Gani Mazumder, Se Jin Park	A Conformal Mapping Approach for Shoe Last Design.	FBIT	2007	DBLP DOI BibTeX RDF
28	Alain Bretto, Luc Gillibert	G-graphs for the cage problem: a new upper bound.	ISSAC	2007	DBLP DOI BibTeX RDF	G-graphs, cage graphs, graphs from group
28	Veselin Jungic, Daniel Král, Riste Skrekovski	Colorings Of Plane Graphs With No Rainbow Faces.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C15
28	Iannis Tourlakis	New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy.	CCC	2006	DBLP DOI BibTeX RDF
28	Xiao-Yu Hu, Evangelos Eleftheriou, Dieter-Michael Arnold	Regular and irregular progressive edge-growth tanner graphs.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
28	Joan Feigenbaum, Sampath Kannan, Andrew McGregor 0001, Siddharth Suri, Jian Zhang 0004	Graph distances in the streaming model: the value of space.	SODA	2005	DBLP BibTeX RDF
28	Thomas P. Hayes, Eric Vigoda	Coupling with the stationary distribution and improved sampling for colorings and independent sets.	SODA	2005	DBLP BibTeX RDF
28	Keith E. Mellinger	LDPC Codes from Triangle-Free Line Sets.	Des. Codes Cryptogr.	2004	DBLP DOI BibTeX RDF	polarity, LDPC codes, cap
28	Lei Wei 0003	Several properties of short LDPC codes.	IEEE Trans. Commun.	2004	DBLP DOI BibTeX RDF
28	Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda	Randomly Coloring Constant Degree Graphs.	FOCS	2004	DBLP DOI BibTeX RDF
28	Christopher Parker, Peter Rowley	Subgroup-Chain Graphs.	Graphs Comb.	2003	DBLP DOI BibTeX RDF
28	Thomas P. Hayes, Eric Vigoda	A Non-Markovian Coupling for Randomly Sampling Colorings.	FOCS	2003	DBLP DOI BibTeX RDF
28	Paul S. Bonsma	The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes.	WG	2003	DBLP DOI BibTeX RDF
28	Lukasz Kowalik, Maciej Kurowski	Short path queries in planar graphs in constant time.	STOC	2003	DBLP DOI BibTeX RDF	shortest path, queries, planar graph
28	Guy Kortsarz, Robert Krauthgamer	On approximating the achromatic number.	SODA	2001	DBLP BibTeX RDF
28	Andreas Brandstädt	Short Disjoint Cycles in Cubic Bridgeless Graphs.	WG	1991	DBLP DOI BibTeX RDF
26	Venkatesh Raman 0001, Saket Saurabh 0001, C. R. Subramanian 0001	Faster fixed parameter tractable algorithms for finding feedback vertex sets.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	parameterized complexity, Feedback vertex set, girth
26	Gerard J. Chang, Chiuyuan Chen, Yaping Chen	Vertex and Tree Arboricities of Graphs.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	arboricity, block-cactus graph, tree, planar graph, hamiltonian cycle, cograph, acyclic, series-parallel graph, girth
15	Zhenzhen Lou, Lu Lu 0012, Xueyi Huang	Spectral Radius of Graphs with Given Size and Odd Girth.	Electron. J. Comb.	2024	DBLP DOI BibTeX RDF
15	Rong Chen, Yidong Zhou	Graphs with Girth $2\ell+1$ and Without Longer Odd Holes that Contain an Odd $K_4$-Subdivision.	Electron. J. Comb.	2024	DBLP DOI BibTeX RDF
15	Wei Ren, Jian Shuai, Yuan Mei	Experiment-Based Reliability Analysis of Girth Welds on Different Grade Steel Pipelines.	IEEE Trans. Reliab.	2024	DBLP DOI BibTeX RDF
15	Qi Wang, Jingping Che, Huaan Li, Zhen Luo, Bo Zhang, Hui Liu	Tanner (3, 23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution.	IEEE Access	2024	DBLP DOI BibTeX RDF
15	Danjun Huang, Xianxi Wu	Equitable Coloring of IC-Planar Graphs with Girth g ≥ 7.	Axioms	2024	DBLP DOI BibTeX RDF
15	Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz	Token Sliding on Graphs of Girth Five.	Algorithmica	2024	DBLP DOI BibTeX RDF
15	Gang Zhang, Baoyindureng Wu	Cycle Isolation of Graphs with Small Girth.	Graphs Comb.	2024	DBLP DOI BibTeX RDF
15	Hongyang Wang	On the chromatic number of graphs of odd girth without longer odd holes.	Discret. Appl. Math.	2024	DBLP DOI BibTeX RDF
15	Lushuai Xu, Shaohua Dong, Haotian Wei, Donghua Peng, Weichao Qian, Qingying Ren, Luming Wang, Yundong Ma	Intelligent identification of girth welds defects in pipelines using neural networks with attention modules.	Eng. Appl. Artif. Intell.	2024	DBLP DOI BibTeX RDF
15	Vladislav Taranchuk	A simple proof for the lower bound of the girth of graphs D(n,q).	Discret. Math.	2024	DBLP DOI BibTeX RDF
15	Garner Cochran	Large girth and small oriented diameter graphs.	Discret. Math.	2024	DBLP DOI BibTeX RDF
15	David K. Garnick	Radius $r$ extremal graphs of girth 5.	Australas. J Comb.	2024	DBLP BibTeX RDF
15	Reza Naserasr, Weiqiang Yu	On the packing number of antibalanced signed simple planar graphs of negative girth at least 5.	J. Comb. Optim.	2024	DBLP DOI BibTeX RDF
15	Alina Harbuzova, Ce Jin 0001, Virginia Vassilevska Williams, Zixuan Xu	Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation.	SODA	2024	DBLP DOI BibTeX RDF
15	Grahame Erskine, James Tuite	Small Graphs and Hypergraphs of Given Degree and Girth.	Electron. J. Comb.	2023	DBLP DOI BibTeX RDF
15	Ming Xu, Xiaoyan Cheng, Yuansheng Tang	Girth of the algebraic bipartite graph D(k,q).	Finite Fields Their Appl.	2023	DBLP DOI BibTeX RDF
15	Ilya D. Shkredov	On a girth-free variant of the Bourgain-Gamburd machine.	Finite Fields Their Appl.	2023	DBLP DOI BibTeX RDF
15	Palaniyappan Nithya, Suresh Elumalai, Selvaraj Balachandran, Sourav Mondal	Smallest ABS index of unicyclic graphs with given girth.	J. Appl. Math. Comput.	2023	DBLP DOI BibTeX RDF
15	Juhua Wang, Jianhua Zhang, Quan Zhou, Lintao Zhang	Full-Length Row-Multiplier QC-LDPC Codes With Girth Eight and Short Circulant Sizes.	IEEE Access	2023	DBLP DOI BibTeX RDF
15	Wang Hui, Adnan Aslam, Salma Kanwal, Mahnoor Akram, Tahira Sumbal Shaikh, Xuewu Zuo	Ordering Unicyclic Connected Graphs with Girth g ≥ 3 Having Greatest SK Indices.	Symmetry	2023	DBLP DOI BibTeX RDF
15	Valentin Bartier, Nicolas Bousquet, Carl Feghali, Marc Heinrich, Benjamin Moore, Théo Pierron	Recoloring Planar Graphs of Girth at Least Five.	SIAM J. Discret. Math.	2023	DBLP DOI BibTeX RDF
15	Kaiyang Lan, Feng Liu	The Chromatic Number of a Graph with Two Odd Holes and an Odd Girth.	Graphs Comb.	2023	DBLP DOI BibTeX RDF
15	Benjamin Friedman, Sean McGuinness	Girth Conditions and Rota's Basis Conjecture.	Graphs Comb.	2023	DBLP DOI BibTeX RDF
15	Ashwin Jacob, Michal Wlodarczyk 0001, Meirav Zehavi	Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large.	CoRR	2023	DBLP DOI BibTeX RDF
15	Alina Harbuzova, Ce Jin 0001, Virginia Vassilevska Williams, Zixuan Xu	Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation.	CoRR	2023	DBLP DOI BibTeX RDF
15	Jialu Zhu, Xuding Zhu	The circular chromatic number of signed series-parallel graphs of given girth.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
15	Alex Alochukwu, Peter Dankelmann	On Wiener index and average eccentricity of graphs of girth at least 6 and (C4,C5)-free graphs.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
15	Xiaoling Liu, Lei Sun, Wei Zheng	Path partition of planar graphs with girth at least six.	Discret. Math. Algorithms Appl.	2023	DBLP DOI BibTeX RDF
15	Dharmeshkumar Patel, Ninad Bhatt	Performance Evaluation of Conventional and Neural Network-Based Decoder for an Audio of Low-Girth LDPC Code.	J. Electr. Comput. Eng.	2023	DBLP DOI BibTeX RDF
15	Iva Antoncic, Primoz Sparl	On tetravalent half-arc-transitive graphs of girth 5.	Discret. Math.	2023	DBLP DOI BibTeX RDF
15	Ming Xu, Xiaoyan Cheng, Yuansheng Tang	On the girth cycles of the bipartite graph D(k,q).	Discret. Math.	2023	DBLP DOI BibTeX RDF
15	Min Chen 0012, André Raspaud, Weifan Wang 0001, Weiqiang Yu	An (F3, F5)-partition of planar graphs with girth at least 5.	Discret. Math.	2023	DBLP DOI BibTeX RDF