Search results for "graph problems"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
4	Biing-Feng Wang, Gen-Huey Chen	Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems.	IEEE Trans. Parallel Distrib. Syst.	1990	DBLP DOI BibTeX RDF	related graph problems, reconfigurable bus systems, parallel algorithms, graph theory, minimum spanning trees, bipartite graphs, transitive closure, transitive closure, connected components, processor arrays, undirected graph, bridges, biconnected components, graph problems, articulation points
4	Kwan Woo Ryu, Joseph JáJá	Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube.	IEEE Trans. Parallel Distrib. Syst.	1990	DBLP DOI BibTeX RDF	linear speedup, basic graph problems, tree expression evaluation, st-numbering, one-port communication, parallel algorithms, computational complexity, load balancing, graph theory, sorting, sorting, graph algorithms, biconnected components, list ranking, graph problems, hypercube algorithm, hypercube algorithms, ear decomposition
2	Sashka Davis, Russell Impagliazzo	Models of Greedy Algorithms for Graph Problems.	Algorithmica	2009	DBLP DOI BibTeX RDF	Graph optimization problems, Greedy algorithms, Priority algorithms
2	Guojing Cong, Sreedhar B. Kodali, Sriram Krishnamoorthy, Doug Lea, Vijay A. Saraswat, Tong Wen	Solving Large, Irregular Graph Problems Using Adaptive Work-Stealing.	ICPP	2008	DBLP DOI BibTeX RDF
2	Cécile Murat, Vangelis Th. Paschos	Vertex-Uncertainty in Graph-Problems.	COCOA	2008	DBLP DOI BibTeX RDF
2	Xiuzhen Huang, Jing Lai	Parameterized Graph Problems in Computational Biology.	IMSCCS	2007	DBLP DOI BibTeX RDF
2	Xiuzhen Huang, Jianer Chen	On PTAS for Planar Graph Problems.	IFIP TCS	2006	DBLP DOI BibTeX RDF
2	David A. Bader	High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology.	WEA	2005	DBLP DOI BibTeX RDF
2	Sashka Davis, Russell Impagliazzo	Models of greedy algorithms for graph problems.	SODA	2004	DBLP DOI BibTeX RDF
2	Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla	Quantum Query Complexity of Some Graph Problems.	ICALP	2004	DBLP DOI BibTeX RDF
2	Aija Berzina, Andrej Dubrovsky, Rusins Freivalds, Lelde Lace, Oksana Scegulnaja	Quantum Query Complexity for Some Graph Problems.	SOFSEM	2004	DBLP DOI BibTeX RDF
2	Erik D. Demaine, Mohammad Taghi Hajiaghayi	Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth.	Graph Drawing	2004	DBLP DOI BibTeX RDF
2	Jop F. Sibeyn	External Connected Components.	SWAT	2004	DBLP DOI BibTeX RDF	External Algorithms, Tree Rooting, Connected Components, List Ranking, Graph Problems
2	Günther R. Raidl, Gabriele Kodydek, Bryant A. Julstrom	On Weight-Biased Mutation for Graph Problems.	PPSN	2002	DBLP DOI BibTeX RDF
2	Yvo Desmedt, Yongge Wang	Efficient Zero-Knowledge Proofs for Some Practical Graph Problems.	SCN	2002	DBLP DOI BibTeX RDF	complexity, graph theory, secret sharing, Zero-knowledge, key-escrow
2	Wolfgang Espelage, Frank Gurski, Egon Wanke	How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.	WG	2001	DBLP DOI BibTeX RDF
2	Jochen Alber, Henning Fernau, Rolf Niedermeier	Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems.	ICALP	2001	DBLP DOI BibTeX RDF
2	Bryant A. Julstrom, Günther R. Raidl	Weight-biased edge-crossover in evolutionary algorithms for wto graph problems.	SAC	2001	DBLP DOI BibTeX RDF	constrained minimum spanning trees, cost-based heuristics, traveling salesman problem, crossover, graph problems
2	Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi	On the Complexity of Approximating Colored-Graph Problems.	COCOON	1999	DBLP DOI BibTeX RDF
2	Jop F. Sibeyn, Michael Kaufmann	Solving Cheap Graph Problems an Meshes.	MFCS	1995	DBLP DOI BibTeX RDF
2	Gen-Huey Chen, Biing-Feng Wang, Chi-Jen Lu	On the Parallel Computation of the Algebraic Path Problem.	IEEE Trans. Parallel Distrib. Syst.	1992	DBLP DOI BibTeX RDF	all pairsshortest paths, reconfigurable bus system, repeated matrix multiplications, parallel algorithms, computational complexity, parallel computation, graph theory, minimum spanning tree, transitive closure, processor array, CRCW PRAM, graph problems, algebraic path problem
2	Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Michael A. Palis	Systolic algorithms for some scheduling and graph problems.	VLSI Signal Processing	1990	DBLP DOI BibTeX RDF
2	Thomas Lengauer, Klaus W. Wagner	The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems.	STACS	1987	DBLP DOI BibTeX RDF
2	Susanne E. Hambrusch, Janos Simon	Lower Bounds for Solving Undirected Graph Problems on VLSI.	ICALP	1983	DBLP DOI BibTeX RDF
1	Dominique de Werra	Some Graph Problems Arising in Elementary Robotics.	ICORES	2012	DBLP BibTeX RDF
1	Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin	Boundary properties of graphs for algorithmic graph problems.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Krishnendu Chatterjee, Monika Henzinger	Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification.	SODA	2011	DBLP BibTeX RDF
1	Brahim Betkaoui, David B. Thomas, Wayne Luk, Natasa Przulj	A framework for FPGA acceleration of large graph problems: Graphlet counting case study.	FPT	2011	DBLP DOI BibTeX RDF
1	Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen	Linear Problem Kernels for Planar Graph Problems with Small Distance Property.	MFCS	2011	DBLP DOI BibTeX RDF
1	Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii	Filtering: a method for solving graph problems in MapReduce.	SPAA	2011	DBLP DOI BibTeX RDF
1	Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini	Adapting parallel algorithms to the W-Stream model, with applications to graph problems.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Refael Hassin, Jérôme Monnot, Danny Segev	The Complexity of Bottleneck Labeled Graph Problems.	Algorithmica	2010	DBLP DOI BibTeX RDF
1	Cécile Murat, Vangelis Th. Paschos	Probabilistic optimization in graph-problems.	Algorithmic Operations Research	2010	DBLP BibTeX RDF
1	Johannes Schneider, Roger Wattenhofer	Brief announcement: efficient graph algorithms without synchronization.	PODC	2010	DBLP DOI BibTeX RDF	parallel algorithms, coloring, dominating sets, concurrent data structures
1	Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette	On the parameterized complexity of multiple-interval graph problems.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Israel Mark Martínez-Pérez, Karl-Heinz Zimmermann	Parallel bioinspired algorithms for NP complete graph problems.	J. Parallel Distrib. Comput.	2009	DBLP DOI BibTeX RDF
1	Falk Hüffner	Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und Experimente (Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems).	it - Information Technology	2009	DBLP DOI BibTeX RDF
1	Maged M. Michael, Martin T. Vechev, Vijay A. Saraswat	Idempotent work stealing.	PPOPP	2009	DBLP DOI BibTeX RDF	memory barrier, memory fence, atomic, work stealing
1	Avner Magen, Mohammad Moharrami	Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
1	Detlef Plump	The Graph Programming Language GP.	CAI	2009	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann	Graph-Based Data Clustering with Overlaps.	COCOON	2009	DBLP DOI BibTeX RDF
1	Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith	Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution.	ESA	2009	DBLP DOI BibTeX RDF
1	Kook Jin Ahn, Sudipto Guha	Graph Sparsification in the Semi-streaming Model.	ICALP	2009	DBLP DOI BibTeX RDF
1	Amit Chakrabarti, Graham Cormode, Andrew McGregor	Annotations in Data Streams.	ICALP	2009	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx	Planar Capacitated Dominating Set Is W[1]-Hard.	IWPEC	2009	DBLP DOI BibTeX RDF
1	Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle	Boolean-Width of Graphs.	IWPEC	2009	DBLP DOI BibTeX RDF
1	Peter Damaschke	Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms.	IWPEC	2009	DBLP DOI BibTeX RDF
1	Atish Das Sarma, Richard J. Lipton, Danupon Nanongkai	Best-Order Streaming Model.	TAMC	2009	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Jiong Guo, Iyad A. Kanj	The Parameterized Complexity of Some Minimum Label Problems.	WG	2009	DBLP DOI BibTeX RDF
1	Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi	Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction.	Algorithmica	2009	DBLP DOI BibTeX RDF	Bidimensionality, Wagner’s conjecture, Graph algorithms, Treewidth, Graph minors, Grid graphs
1	Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh	The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Max-leaf, Well-quasiordering, Bandwidth, Kernelization, Parameterized complexity
1	Camil Demetrescu, Giuseppe F. Italiano	Trade-Offs for Dynamic Graph Problems.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	Erik D. Demaine, MohammadTaghi Hajiaghayi	Approximation Schemes for Planar Graph Problems.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	Deniss Kumlander	NP-Hard Graph Problems' Algorithms Testing Guidelines: Artificial Intelligence Principles and Testing as a Service.	Innovative Techniques in Instruction Technology, E-learning, E-assessment, and Education	2008	DBLP DOI BibTeX RDF
1	Guy E. Blelloch, Virginia Vassilevska, Ryan Williams	A New Combinatorial Approach for Sparse Graph Problems.	ICALP	2008	DBLP DOI BibTeX RDF
1	David A. Bader	Petascale Computing for Large-Scale Graph Problems.	CISIS	2008	DBLP DOI BibTeX RDF
1	Harald Räcke	Optimal hierarchical decompositions for congestion minimization in networks.	STOC	2008	DBLP DOI BibTeX RDF	approximating metrics by tree metrics, oblivious routing
1	Richard B. Borie, R. Gary Parker, Craig A. Tovey	Solving problems on recursively constructed graphs.	ACM Comput. Surv.	2008	DBLP DOI BibTeX RDF	Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth
1	Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugues Hoppe	Efficient traversal of mesh edges using adjacency primitives.	ACM Trans. Graph.	2008	DBLP DOI BibTeX RDF	programmable geometry shader, vertex locality, real-time rendering, silhouettes, shadow volumes
1	Akshaye Dhawan, Sushil K. Prasad	A distributed algorithmic framework for coverage problems in Wireless Sensor Networks.	IPDPS	2008	DBLP DOI BibTeX RDF
1	Hans-Jörg Kreowski, Sabine Kuske	Graph Multiset Transformation as a Framework for Massively Parallel Computation.	ICGT	2008	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh	Graph Layout Problems Parameterized by Vertex Cover.	ISAAC	2008	DBLP DOI BibTeX RDF
1	Michael Lampis, Georgia Kaouri, Valia Mitsou	On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures.	ISAAC	2008	DBLP DOI BibTeX RDF	Digraph decompositions, Treewidth, Parameterized Complexity
1	Yonatan Aumann, Yair Dombb	Fixed Structure Complexity.	IWPEC	2008	DBLP DOI BibTeX RDF
1	Erik D. Demaine	Algorithmic Graph Minors and Bidimensionality.	IWPEC	2008	DBLP DOI BibTeX RDF
1	Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard	Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality.	SOFSEM	2008	DBLP DOI BibTeX RDF	Bipartite perfect matching, Shortest path, Spanning tree, Robust optimization, Interval data
1	Satyajit Banerjee, Atish Datta Chowdhury, Subhas Kumar Ghosh	Efficient Algorithms for Variants of Weighted Matching and Assignment Problems.	Mathematics in Computer Science	2008	DBLP DOI BibTeX RDF	Maximum weight maximum cardinality matching, approximation algorithm, graph algorithm, reduction
1	Daniel Mölle, Stefan Richter, Peter Rossmanith	Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Enumerate and expand, Exact algorithms, Vertex cover, Parameterized complexity
1	Falk Hüffner	Algorithms and experiments for parameterized approaches to hard graph problems.		2007	RDF
1	Vladimir E. Alekseev, Rodica Boliac, Dmitry V. Korobitsyn, Vadim V. Lozin	NP-hard graph problems and boundary classes of graphs.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Amin Coja-Oghlan	Solving NP-hard semirandom graph problems in polynomial expected time.	J. Algorithms	2007	DBLP DOI BibTeX RDF
1	Sanjiv Kapoor, Mohammad Sarwat	Bounded-Diameter Minimum-Cost Graph Problems.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
1	Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia	Genus characterizes the complexity of certain graph problems: Some tight results.	J. Comput. Syst. Sci.	2007	DBLP DOI BibTeX RDF
1	David A. Bader	Petascale Computing for Large-Scale Graph Problems.	PPAM	2007	DBLP DOI BibTeX RDF
1	Refael Hassin, Jérôme Monnot, Danny Segev	The Complexity of Bottleneck Labeled Graph Problems.	WG	2007	DBLP DOI BibTeX RDF
1	David A. Bader	Petascale Computing for Large-Scale Graph Problems.	IPDPS	2007	DBLP DOI BibTeX RDF
1	Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini	Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems.	MFCS	2007	DBLP DOI BibTeX RDF
1	Deniss Kumlander	On places suitable for applying AI principles in NP-hard graph problems' algorithms.	Artificial Intelligence and Applications	2007	DBLP BibTeX RDF
1	Michael Elkin	A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners.	PODC	2007	DBLP DOI BibTeX RDF	distributed dynamic algorithms, spanners
1	Amirhossein Alimohammad, Saeed Fouladi Fard, Bruce F. Cockburn, Christian Schlegel	A Flexible Filter Processor for Fading Channel Simulation.	FCCM	2007	DBLP DOI BibTeX RDF
1	Zachary K. Baker, Maya Gokhale	On the Acceleration of Shortest Path Calculations in Transportation Networks.	FCCM	2007	DBLP DOI BibTeX RDF
1	George Chin Jr., Daniel G. Chavarría-Miranda, Grant C. Nakamura, Heidi J. Sofia	A High-Performance Computational Framework for Bionetwork Analysis.	IMSCCS	2007	DBLP DOI BibTeX RDF
1	Love Singhal, Elaheh Bozorgzadeh, David Eppstein	Interconnect Criticality-Driven Delay Relaxation.	IEEE Trans. on CAD of Integrated Circuits and Systems	2007	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Frances A. Rosamond	The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.	CiE	2007	DBLP DOI BibTeX RDF
1	Luca Trevisan	Fun with Sub-linear Time Algorithms.	FUN	2007	DBLP DOI BibTeX RDF
1	Mohammad R. Hoseinyfarahabady, Hamid Sarbazi-Azad	On Pancyclicity Properties of OTIS Networks.	HPCC	2007	DBLP DOI BibTeX RDF
1	Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos	Subexponential Parameterized Algorithms.	ICALP	2007	DBLP DOI BibTeX RDF
1	Federico Mancini	Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs.	ISAAC	2007	DBLP DOI BibTeX RDF
1	Guojing Cong, David A. Bader	Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors.	ISPA	2007	DBLP DOI BibTeX RDF	Shared Memory, Spanning Tree, Minimum Spanning Tree, Biconnected Components
1	Pino Caballero-Gil, Cándido Caballero-Gil	A Global Authentication Scheme for Mobile Ad-Hoc Networks.	IWSEC	2007	DBLP DOI BibTeX RDF	MANETs, Authentication, Access Control
1	Stefan Porschen, Ewald Speckenmeyer	Algorithms for Variable-Weighted 2-SAT and Dual Problems.	SAT	2007	DBLP DOI BibTeX RDF	weighted satisfiability, edge cover, graph factor, NP-hardness, optimization problem, perfect matching
1	Frederic Dorn	How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms.	WG	2007	DBLP DOI BibTeX RDF
1	Vadim V. Lozin, Martin Milanic	Tree-Width and Optimization in Bounded Degree Graphs.	WG	2007	DBLP DOI BibTeX RDF	Hereditary class of graphs, Induced Matching, Dominating set, Tree-width
1	Stefan Porschen	On variable-weighted exact satisfiability problems.	Ann. Math. Artif. Intell.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 03B05, 68Q25, 05C85
1	Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla	Quantum Query Complexity of Some Graph Problems.	SIAM J. Comput.	2006	DBLP DOI BibTeX RDF
1	Yair Bartal, Amos Fiat, Stefano Leonardi	Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing.	SIAM J. Comput.	2006	DBLP DOI BibTeX RDF
1	Britta Kehden, Frank Neumann	A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems.	EvoCOP	2006	DBLP DOI BibTeX RDF
1	Deepak Ajwani, Roman Dementiev, Ulrich Meyer	A computational study of external-memory BFS algorithms.	SODA	2006	DBLP DOI BibTeX RDF
1	Camil Demetrescu, Irene Finocchi, Andrea Ribichini	Trading off space for passes in graph streaming problems.	SODA	2006	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider	Clique-width minimization is NP-hard.	STOC	2006	DBLP DOI BibTeX RDF	absolute approximation, NP-completeness, clique-width, pathwidth