Search results for "breadth-first-search"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
94	Charles E. Leiserson, Tao B. Schardl	A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers).	SPAA	2010	DBLP DOI BibTeX RDF	hyperobjects, parallel algorithms, multithreading, graph algorithms, reducers, nondeterminism, work-stealing, breadth-first search, cilk
73	Jiri Barnat, Ivana Cerná	Distributed breadth-first search LTL model checking.	Formal Methods Syst. Des.	2006	DBLP DOI BibTeX RDF	LTL model checking, Distributed memory, Breadth-first search
57	Richard E. Korf, Weixiong Zhang, Ignacio Thayer, Heath Hohwald	Frontier search.	J. ACM	2005	DBLP DOI BibTeX RDF	bidirectional search, sliding-tile puzzles, heuristic search, sequence alignment, Dijkstra's algorithm, breadth-first search, best-first search, A* algorithm, Towers of Hanoi
51	Dragan Bosnacki, Gerard J. Holzmann	Improving Spin's Partial-Order Reduction for Breadth-First Search.	SPIN	2005	DBLP DOI BibTeX RDF
49	David A. Bader, Kamesh Madduri	Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2.	ICPP	2006	DBLP DOI BibTeX RDF
48	Jin Kim, Byung Ro Moon	A hybrid genetic algorithm for a variant of two-dimensional packing problem.	GECCO	2009	DBLP DOI BibTeX RDF	geographic crossover, local search, packing, hybrid genetic algorithm, breadth-first search, two-dimensional
46	R. John M. Hughes, S. Doaitse Swierstra	Polish parsers, step by step.	ICFP	2003	DBLP DOI BibTeX RDF	GLR parsing, Polish representation, ambiguous grammars, online results, breadth-first search, parser combinators
46	Pilar de la Torre, Clyde P. Kruskal	Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search.	Theory Comput. Syst.	2001	DBLP DOI BibTeX RDF
46	Yugang Jia, Christophe Andrieu, Robert J. Piechocki, Magnus Sandell	Depth-First and Breadth-First Search Based Multilevel SGA Algorithms for Near Optimal Symbol Detection in MIMO Systems.	IEEE Trans. Wirel. Commun.	2008	DBLP DOI BibTeX RDF
45	Jayant Kumar, Wael Abd-Almageed, Le Kang, David S. Doermann	Handwritten Arabic text line segmentation using affinity propagation.	Document Analysis Systems	2010	DBLP DOI BibTeX RDF	Arabic documents, Dijkstra's shortest path algorithm, handwritten documents, text line segmentation, clustering, Arabic, breadth-first search, line detection, affinity propagation
45	Lars Arge, Ulrich Meyer 0001, Laura Toma, Norbert Zeh	On External-Memory Planar Depth First Search.	WADS	2001	DBLP DOI BibTeX RDF
45	Yue Hou, Jinyun Pu	The Intelligent Damage Assessment and Intelligent Reconfiguration System of Ship Diesel System.	SNPD (3)	2007	DBLP DOI BibTeX RDF	Graph theory, Reconfiguration, Arithmetic, Breadth first search, Damage assessment
45	Chunjiang Wu, Shijie Zhou, Linna Wei, Jiaqing Luo, Yanli Wang, Xiaoqian Yang	A New k-Graph Partition Algorithm for Distributed P2P Simulation Systems.	ICA3PP	2007	DBLP DOI BibTeX RDF	Degree Sequence, P2P, Graph Partition, Distributed Simulation, Breadth-First Search
45	Ryuhei Uehara	Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs.	ICALP	2002	DBLP DOI BibTeX RDF	Chordal bipartite graphs, lexicographic breadth first search, vertex elimination ordering, strongly chordal graphs, design and analysis of algorithms
45	Eugene Goldberg, Alexander Saldanha	Timing Analysis with Implicitly Specified False Paths.	VLSI Design	2000	DBLP DOI BibTeX RDF	known false paths, implicit false path representation, timing analysis, breadth-first search
45	Igor Parfenoff, Florian Roussel, Irena Rusu	Triangulated Neighbourhoods in C4-Free Berge Graphs.	WG	1999	DBLP DOI BibTeX RDF	lexicographic breadth-first search, triangulated graph, perfectness
45	Thomas H. Spencer	Time-work tradeoffs for parallel algorithms.	J. ACM	1997	DBLP DOI BibTeX RDF	nearby lists, shortest path, PRAM, transitive closure, breadth first search, topological sort
45	Jordi Tubella, Antonio González 0001	Exploiting path parallelism in logic programming.	PDP	1995	DBLP DOI BibTeX RDF	path parallelism, partial breadth-first search, SLD-tree, SPMD architecture, non-deterministic programs, parallel programming, logic programming, logic programming, PROLOG, Prolog, data parallelism, Multipath, execution model
42	Pilar de la Torre, Clyde P. Kruskal	Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First Search.	ICPP (3)	1991	DBLP BibTeX RDF
42	DoRon B. Motter, Igor L. Markov	A Compressed Breadth-First Search for Satisfiability.	ALENEX	2002	DBLP DOI BibTeX RDF
40	Jiri Barnat, Lubos Brim, Jakub Chaloupka	Parallel Breadth-First Search LTL Model-Checking.	ASE	2003	DBLP DOI BibTeX RDF
39	Derek G. Corneil	Lexicographic Breadth First Search - A Survey.	WG	2004	DBLP DOI BibTeX RDF
39	Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer 0001, Norbert Zeh	Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.	SWAT	2004	DBLP DOI BibTeX RDF
39	Kurt Mehlhorn, Ulrich Meyer 0001	External-Memory Breadth-First Search with Sublinear I/O.	ESA	2002	DBLP DOI BibTeX RDF
38	Lijuan Luo, Martin D. F. Wong, Wen-mei W. Hwu	An effective GPU implementation of breadth-first search.	DAC	2010	DBLP DOI BibTeX RDF	BFS, CUDA, GPU computing
38	Christophe Crespelle, Philippe Gambette	Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search.	IWOCA	2009	DBLP DOI BibTeX RDF
38	Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Petrini	Efficient Breadth-First Search on the Cell/BE Processor.	IEEE Trans. Parallel Distributed Syst.	2008	DBLP DOI BibTeX RDF
38	Yongtao Su, Xian-Da Zhang, Xiaodong Wang 0001	A successive interference cancellation algorithm in MIMO systems via breadth-first search.	ICASSP	2008	DBLP DOI BibTeX RDF
38	B. John Oommen, Ghada Hany Badr	Breadth-first search strategies for trie-based syntactic pattern recognition.	Pattern Anal. Appl.	2007	DBLP DOI BibTeX RDF	Trie-based syntactic pattern recognition, Noisy syntactic recognition using tries, Approximate string matching
38	Bratislav Milic, Miroslaw Malek	Adaptation of the breadth first search algorithm for cut-edge detection in wireless multihop networks.	MSWiM	2007	DBLP DOI BibTeX RDF	cut-edge detection, real network analysis, wireless multihop networks
38	Andy Yoo, Edmond Chow, Keith W. Henderson, Will McLendon III, Bruce Hendrickson, Ümit V. Çatalyürek	A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L.	SC	2005	DBLP DOI BibTeX RDF
38	Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio	Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs.	STACS	1997	DBLP DOI BibTeX RDF
38	Raymond Greenlaw	The parallel complexity of queue versus stack breadth-first search.	SPDP	1990	DBLP DOI BibTeX RDF
36	Emir Zunic, Almir Djedovic, B. Zunic	Software solution for optimal planning of sales persons work based on Depth-First Search and Breadth-First Search algorithms.	MIPRO	2016	DBLP DOI BibTeX RDF
34	Stefan Edelkamp, Shahid Jabbar	Real-Time Model Checking on Secondary Storage.	MoChArt	2006	DBLP DOI BibTeX RDF
33	Jingfeng Yan, Yipin Zhang, Fangyu Xia	Research on a Novel P2P Search Algorithm.	MVHI	2010	DBLP DOI BibTeX RDF	Unit Tre, component, P2P, Breadth First Search
33	Peter Djeu, Sean Keely, Warren A. Hunt	Accelerating shadow rays using volumetric occluders and modified kd-tree traversal.	High Performance Graphics	2009	DBLP DOI BibTeX RDF	extended ray order, quick descent breadth-first search, shadow rays, volumetric occluders, soft shadows
33	Andreas Brandstädt, Chính T. Hoàng	Maximum Induced Matchings for Chordal Graphs in Linear Time.	Algorithmica	2008	DBLP DOI BibTeX RDF	Maximum induced matchings, Perfect elimination order, Lexicographic breadth-first search, Chordal graphs, Linear time algorithm
33	Roderick Bloem, Harold N. Gabow, Fabio Somenzi	An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps.	Formal Methods Syst. Des.	2006	DBLP DOI BibTeX RDF	language emptiness, Büchi automata, Streett automata, model checking, binary decision diagrams, depth-first search, breadth-first search, strongly connected components, symbolic algorithms
33	Marc Najork, Janet L. Wiener	Breadth-first crawling yields high-quality pages.	WWW	2001	DBLP DOI BibTeX RDF	crawl order, page quality, metric, PageRank, crawling, breadth-first search
33	Y. Daniel Liang, Chongkye Rhee	An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs.	ACM Conference on Computer Science	1995	DBLP DOI BibTeX RDF	algorithm, breadth-first search, biconnected component, permutation graph
33	Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg	Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers	FOCS	1993	DBLP DOI BibTeX RDF	near-linear cost sequential constructions, distributed constructions, sparse neighborhood covers, dynamic approximate shortest paths, distance-preserving graph spanners, network synchronizer constructions, adaptive routing, sequential algorithms, breadth-first-search, network decompositions
33	Calvin Ching-Yuen Chen, Sajal K. Das 0001	Parallel Breadth-First and Breadth-Depth Traversals of Generated Trees.	ICCI	1990	DBLP DOI BibTeX RDF	Linked list ranking, Breadth-depth search, Optimal speedup, Parallel algorithm, Breadth-first search, Tree traversal
33	Philip N. Klein	Efficient Parallel Algorithms for Chordal Graphs	FOCS	1988	DBLP DOI BibTeX RDF	elimination ordering, optimal coloring, breadth-first search tree, depth-first search tree, parallel algorithms, interval graphs, chordal graphs, isomorphism, maximum independent set, maximum clique
32	Andras Ferenczi, Costin Badica	An Implementation of Depth-First and Breadth-First Search Algorithms for Tip Selection in IOTA Distributed Ledger.	ACIIDS (1)	2022	DBLP DOI BibTeX RDF
32	Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan	Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs.	Inf. Process. Lett.	1994	DBLP DOI BibTeX RDF
32	Jordi Tubella, Antonio González 0001	Combining depth-first and breadth-first search in Prolog execution.	GULP-PRODE (2)	1994	DBLP BibTeX RDF
31	Dragan Bosnacki, Stefan Leue, Alberto Lluch-Lafuente	Partial-order reduction for general state exploring algorithms.	Int. J. Softw. Tools Technol. Transf.	2009	DBLP DOI BibTeX RDF
30	Scott Beamer, Aydin Buluç, Krste Asanovic, David A. Patterson 0001	Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search.	IPDPS Workshops	2013	DBLP DOI BibTeX RDF
30	S. Jeyalatha, B. Vijayakumar	Design and implementation of a web structure mining algorithm using breadth first search strategy for academic search application.	ICITST	2011	DBLP BibTeX RDF
30	Takashi Hirayama, Yasuaki Nishitani	Efficient Search Methods for Obtaining Exact Minimum AND-EXOR Expressions.	DELTA	2006	DBLP DOI BibTeX RDF
27	Brian C. Dean, Michel X. Goemans, Nicole Immorlica	Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data.	ESA	2006	DBLP DOI BibTeX RDF
27	Vincent T'kindt, Federico Della Croce, Carl Esswein	Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems.	J. Sched.	2004	DBLP DOI BibTeX RDF	search tree strategies, dominance properties, branch and bound
27	Dragan Bosnacki, Stefan Leue, Alberto Lluch-Lafuente	Partial-Order Reduction for General State Exploring Algorithms.	SPIN	2006	DBLP DOI BibTeX RDF
26	Kaan Olgu, Tobias Kenter, José L. Núñez-Yáñez, Simon McIntosh-Smith	Optimisation and Evaluation of Breadth First Search with oneAPI/SYCL on Intel FPGAs: from Describing Algorithms to Describing Architectures.	IWOCL	2024	DBLP DOI BibTeX RDF
26	Santhosh B. Gandreti, Ibrahim A., P. S. Sastry	Breadth-First Search Approach for Mining Serial Episodes with Simultaneous Events.	COMAD/CODS	2024	DBLP DOI BibTeX RDF
26	Daegun Yoon, Minjoong Jeong, Sangyoon Oh 0001	WAVE: designing a heuristics-based three-way breadth-first search on GPUs.	J. Supercomput.	2023	DBLP DOI BibTeX RDF
26	Xuyong Chen, Zhifeng Xu, Yushun Wu, Qiaoyun Wu	Heuristic algorithms for reliability estimation based on breadth-first search of a grid tree.	Reliab. Eng. Syst. Saf.	2023	DBLP DOI BibTeX RDF
26	Jie Luo	Exploring Robot Morphology Spaces through Breadth-First Search and Random Query.	CoRR	2023	DBLP DOI BibTeX RDF
26	Emma Fu, Hayden Jananthan, Jeremy Kepner	Algebraic Conditions on One-Step Breadth-First Search.	CoRR	2023	DBLP DOI BibTeX RDF
26	Xuan Liu, Genlang Chen, Fangyu Wu 0001, Shiting Wen, Wanli Zuo	Mining top-k high average-utility itemsets based on breadth-first search.	Appl. Intell.	2023	DBLP DOI BibTeX RDF
26	Chou-Ying Hsieh, Po-Hsiu Cheng, Chia-Ming Chang, Sy-Yen Kuo	A Decentralized Frontier Queue for Improving Scalability of Breadth-First-Search on GPUs.	DATE	2023	DBLP DOI BibTeX RDF
26	Dajiang Sun, Christoforos N. Hadjicostis, Zhiwu Li 0001	Decentralized State Estimation via Breadth-First Search Through Partially Ordered Observation Sequences.	CDC	2023	DBLP DOI BibTeX RDF
26	Jifan Shi, Yun Xu	ABi-BFS: A High-performance Parallel Breadth-First Search on Shared-memory Systems.	ICPADS	2023	DBLP DOI BibTeX RDF
26	Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic	Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances.	STOC	2023	DBLP DOI BibTeX RDF
26	Prachatos Mitra, Alexandros Daglis	Filtering Wasteful Vertex Visits in Breadth-First Search.	SC Workshops	2023	DBLP DOI BibTeX RDF
26	Qunzhao Li, Fei Xie, Jing Zhao, Bing Xu, Jiquan Yang, Xixiang Liu, Hongbo Suo	FPS: Fast Path Planner Algorithm Based on Sparse Visibility Graph and Bidirectional Breadth-First Search.	Remote. Sens.	2022	DBLP DOI BibTeX RDF
26	Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic	Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances.	CoRR	2022	DBLP DOI BibTeX RDF
26	Daegun Yoon, Sangyoon Oh 0001	SURF: Direction-Optimizing Breadth-First Search Using Workload State on GPUs.	Sensors	2022	DBLP DOI BibTeX RDF
26	Zite Jiang, Tao Liu, Shuai Zhang, Mengting Yuan, Haihang You	Fast and efficient parallel breadth-first search with power-law graph transformation.	Frontiers Comput. Sci.	2022	DBLP DOI BibTeX RDF
26	Charles E. Leiserson, Tao B. Schardl	A Work-Efficient Parallel Breadth-First Search Algorithm (or How To Cope With the Nondeterminism of Reducers).	Massive Graph Analytics	2022	DBLP DOI BibTeX RDF
26	Guoqing Lei, Wei Guo, Zhong Zheng, Junhui Wang	A Preliminary Performance Evaluation of Breadth-first Search on a Configurable Processor.	BDE	2022	DBLP DOI BibTeX RDF
26	Congduan Li, Siya Chen, Chee-Wei Tan 0001	Fast Breadth-First Search Approximation for Epidemic Source Inference.	CISS	2022	DBLP DOI BibTeX RDF
26	Paul Burkhardt	Optimal Algebraic Breadth-First Search for Sparse Graphs.	ACM Trans. Knowl. Discov. Data	2021	DBLP DOI BibTeX RDF
26	Yasin Yigit, Vahid Khalilpour Akram, Orhan Dagdeviren	Breadth-first search tree integrated vertex cover algorithms for link monitoring and routing in wireless sensor networks.	Comput. Networks	2021	DBLP DOI BibTeX RDF
26	Hrudaya Kumar Tripathy, Sushruta Mishra, Hiren Kumar Thakkar, Deepak Rai	CARE: A Collision-Aware Mobile Robot Navigation in Grid Environment using Improved Breadth First Search.	Comput. Electr. Eng.	2021	DBLP DOI BibTeX RDF
26	Luk Burchard, Xing Cai, Johannes Langguth	iPUG for Multiple Graphcore IPUs: Optimizing Performance and Scalability of Parallel Breadth-First Search.	HiPC	2021	DBLP DOI BibTeX RDF
26	Masahiro Nakao, Koji Ueno, Katsuki Fujisawa, Yuetsu Kodama, Mitsuhisa Sato	Performance of the Supercomputer Fugaku for Breadth-First Search in Graph500 Benchmark.	ISC	2021	DBLP DOI BibTeX RDF
26	Alexander Anatolyevich Zuenko	The Joint Use of the Breadth-First Search Strategy and the Constraints Propagation in Smart Tables Handling.	CSAE	2021	DBLP DOI BibTeX RDF
26	Oswaldo Artiles, Fahad Saeed	TurboBFS: GPU Based Breadth-First Search (BFS) Algorithms in the Language of Linear Algebra.	IPDPS Workshops	2021	DBLP DOI BibTeX RDF
26	Pedro B. C. Costa, Sónia Ferreira Pinto, José Fernando Silva	Breadth-First Search Leakage Tolerant Commutation Method for Matrix Converters in Three-Phase Solid State Transformers.	IECON	2021	DBLP DOI BibTeX RDF
26	Malte Mues, Falk Howar	JDart: Portfolio Solving, Breadth-First Search and SMT-Lib Strings (Competition Contribution).	TACAS (2)	2021	DBLP DOI BibTeX RDF
26	Mireya Paredes, Graham D. Riley, Mikel Luján	Exploiting Parallelism and Vectorisation in Breadth-First Search for the Intel Xeon Phi.	IEEE Trans. Parallel Distributed Syst.	2020	DBLP DOI BibTeX RDF
26	Zite Jiang, Tao Liu, Shuai Zhang, Zhen Guan, Mengting Yuan, Haihang You	Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation.	CoRR	2020	DBLP BibTeX RDF
26	Maciej Besta, Florian Marending, Edgar Solomonik, Torsten Hoefler	SlimSell: A Vectorizable Graph Representation for Breadth-First Search.	CoRR	2020	DBLP BibTeX RDF
26	Tuyen Phong Truong, Toan Hai Le	A Distributed Directed Breadth-First Search Algorithm Based on Message-Passing Model for Efficient Line-of-Sight Computation.	ICSCA	2020	DBLP DOI BibTeX RDF
26	Chi Zhu, Weixuan Shi, Zhiguang Chen, Nong Xiao, Yutong Lu	An Efficient Approach to Vectorize the Hybrid Breadth-First Search.	HPCC/DSS/SmartCity	2020	DBLP DOI BibTeX RDF
26	Atharva Gondhalekar, Wu-Chun Feng	Exploring FPGA Optimizations in OpenCL for Breadth-First Search on Sparse Graph Datasets.	FPL	2020	DBLP DOI BibTeX RDF
26	Masahiro Nakao, Koji Ueno, Katsuki Fujisawa, Yuetsu Kodama, Mitsuhisa Sato	Performance Evaluation of Supercomputer Fugaku using Breadth-First Search Benchmark in Graph500.	CLUSTER	2020	DBLP DOI BibTeX RDF
26	Janko Böhm, Michael Joswig, Lars Kastner, Andrew Newman	Breadth-first search on a Ramanujan graph.	CoRR	2019	DBLP BibTeX RDF
26	Paul Burkhardt	Optimal algebraic Breadth-First Search for sparse graphs.	CoRR	2019	DBLP BibTeX RDF
26	Qize Xu, Wenting Han, Junshi Chen, Hong An	众核平台上广度优先搜索算法的优化 (Optimization of Breadth-first Search Algorithm Based on Many-core Platform).	计算机科学	2019	DBLP DOI BibTeX RDF
26	Zonghan Wu, Baochang Zhang 0003, Jun Yang, Na Li, Shoujun Zhou	Segmentation of Arteriovenous Malformation Based on Weighted Breadth-First Search of Vascular Skeleton.	MIUA	2019	DBLP DOI BibTeX RDF
26	Khaled Z. Ibrahim	Optimizing Breadth-First Search at Scale Using Hardware-Accelerated Space Consistency.	HiPC	2019	DBLP DOI BibTeX RDF
26	Chenglong Zhang, Huawei Cao, Xiaochun Ye, Guobo Wang, Qinfen Hao, Dongrui Fan	Highly Efficient Breadth-First Search on CPU-Based Single-Node System.	HPCC/SmartCity/DSS	2019	DBLP DOI BibTeX RDF
26	Torben Hagerup	Fast Breadth-First Search in Still Less Space.	WG	2019	DBLP DOI BibTeX RDF
26	Anil Gaihre, Zhenlin Wu, Fan Yao, Hang Liu 0001	XBFS: eXploring Runtime Optimizations for Breadth-First Search on GPUs.	HPDC	2019	DBLP DOI BibTeX RDF
26	Hao Wen 0002, Wei Zhang 0002	Improving Parallelism of Breadth First Search (BFS) Algorithm for Accelerated Performance on GPUs.	HPEC	2019	DBLP DOI BibTeX RDF
26	Dominik Tödling, Martin Winter, Markus Steinberger	Breadth-First Search on Dynamic Graphs using Dynamic Parallelism on the GPU.	HPEC	2019	DBLP DOI BibTeX RDF
26	Shuli Hu, Nathan R. Sturtevant	Direction-Optimizing Breadth-First Search with External Memory Storage.	IJCAI	2019	DBLP DOI BibTeX RDF