Search results for "Path-width"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
64	Arvind Gupta, Naomi Nishimura	Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width.	STACS	1996	DBLP DOI BibTeX RDF
52	Elizabeth Broering, Satyanarayana V. Lokam	Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract).	SAT	2003	DBLP DOI BibTeX RDF
48	Renate Garbe	Tree-width and Path-width of Comparability Graphs of interval Orders.	WG	1994	DBLP DOI BibTeX RDF
45	János Barát	Directed Path-width and Monotonicity in Digraph Searching.	Graphs Comb.	2006	DBLP DOI BibTeX RDF	Search games, Path-width, Cops-and-robber games, Directed graph, Monotonicity
37	Vida Dujmovic, Pat Morin, David R. Wood	Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs.	GD	2002	DBLP DOI BibTeX RDF
35	Robert Mateescu, Rina Dechter	AND/OR Search Spaces and the Semantic Width of Constraint Networks.	CP	2005	DBLP DOI BibTeX RDF
31	Petr Hlinený	Crossing-Critical Graphs and Path-Width.	GD	2001	DBLP DOI BibTeX RDF
29	Shumin Zhai, Rogier Woltjer	Human Movement Performance in Relation to Path Constraint - The Law of Steering in Locomotion.	VR	2003	DBLP DOI BibTeX RDF
27	Konstantinos Georgiou, Periklis A. Papakonstantinou	Complexity and Algorithms for Well-Structured k-SAT Instances.	SAT	2008	DBLP DOI BibTeX RDF
27	Franz-Josef Brandenburg, Stephanie Herrmann	Graph Searching and Search Time.	SOFSEM	2006	DBLP DOI BibTeX RDF
26	Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Sang-il Oum	Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k.	J. Comb. Theory, Ser. B	2023	DBLP DOI BibTeX RDF
26	Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Sang-il Oum	Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k.	STACS	2022	DBLP DOI BibTeX RDF
26	Frank Gurski, Carolin Rehs	Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs.	SOFSEM	2019	DBLP DOI BibTeX RDF
26	Frank Gurski, Carolin Rehs	Computing directed path-width and directed tree-width of recursively defined digraphs.	CoRR	2018	DBLP BibTeX RDF
26	Frank Gurski, Carolin Rehs	Directed Path-Width and Directed Tree-Width of Directed Co-graphs.	COCOON	2018	DBLP DOI BibTeX RDF
26	Jinjiang Yuan	Path-width and tree-width of the join of graphs.	Ars Comb.	1996	DBLP BibTeX RDF
26	Daniel Bienstock	Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey).	Reliability Of Computer And Communication Networks	1989	DBLP DOI BibTeX RDF
24	David R. Wood	Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing.	FSTTCS	2002	DBLP DOI BibTeX RDF
22		The Forecast of Tornado Variety Based on Function S-rough Sets.	IFITA (3)	2009	DBLP DOI BibTeX RDF	Function Singular Rough Sets, Tornado, Path Width, Path Length
19	Hristo N. Djidjev, Imrich Vrto	An Improved Lower Bound for Crossing Numbers.	GD	2001	DBLP DOI BibTeX RDF
16	Frank Gurski, Carolin Rehs, Jochen Rethmann	Characterizations and Directed Path-Width of Sequence Digraphs.	Theory Comput. Syst.	2023	DBLP DOI BibTeX RDF
16	Oliver Bachtler, Irene Heinrich	Automated testing and interactive construction of unavoidable sets for graph classes of small path-width.	J. Graph Theory	2023	DBLP DOI BibTeX RDF
16	Bahram Rashidi	Efficient full data-path width and serialized hardware structures of SPONGENT lightweight hash function.	Microelectron. J.	2021	DBLP DOI BibTeX RDF
16	Kenta Yonezawa, Yohsuke Yoshioka	Effect of Path Width on Human Distance Perception and Gaze Position During Walking.	AHFE (3)	2021	DBLP DOI BibTeX RDF
16	Petr Hlinený	A Simpler Self-reduction Algorithm for Matroid Path-Width.	SIAM J. Discret. Math.	2018	DBLP DOI BibTeX RDF
16	Frank Gurski, Carolin Rehs, Jochen Rethmann	Characterizations and Directed Path-Width of Sequence Digraphs.	CoRR	2018	DBLP BibTeX RDF
16	Frank Gurski, Carolin Rehs, Jochen Rethmann	Directed Path-Width of Sequence Digraphs.	COCOA	2018	DBLP DOI BibTeX RDF
16	Thanh N. Dang, Robin Thomas 0001	Minors of two-connected graphs of large path-width.	CoRR	2017	DBLP BibTeX RDF
16	Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma	First order limits of sparse graphs: Plane trees and path-width.	Random Struct. Algorithms	2017	DBLP DOI BibTeX RDF
16	Constantin Enea, Peter Habermehl, Omar Inverso, Gennaro Parlato	On the path-width of integer linear programming.	Inf. Comput.	2017	DBLP DOI BibTeX RDF
16	Martin Fürer	Faster Computation of Path-Width.	CoRR	2016	DBLP BibTeX RDF
16	Petr Hlinený	Simpler Self-reduction Algorithm for Matroid Path-width.	CoRR	2016	DBLP BibTeX RDF
16	Jisu Jeong, Eun Jung Kim 0002, Sang-il Oum	Constructive algorithm for path-width of matroids.	SODA	2016	DBLP DOI BibTeX RDF
16	Martin Fürer	Faster Computation of Path-Width.	IWOCA	2016	DBLP DOI BibTeX RDF
16	Jisu Jeong, Eun Jung Kim 0002, Sang-il Oum	Constructive algorithm for path-width of matroids.	CoRR	2015	DBLP BibTeX RDF
16	Constantin Enea, Peter Habermehl, Omar Inverso, Gennaro Parlato	On the Path-Width of Integer Linear Programming.	GandALF	2014	DBLP DOI BibTeX RDF
16	Guoli Ding, Stan Dziobiak	On 3-Connected Graphs of Path-Width at Most Three.	SIAM J. Discret. Math.	2013	DBLP DOI BibTeX RDF
16	Omid Amini, Florian Huc, Stéphane Pérennes	On the Path-Width of Planar Graphs.	SIAM J. Discret. Math.	2009	DBLP DOI BibTeX RDF
16	Brian Beavers, James G. Oxley	Constructive characterizations of 3-connected matroids of path width three.	Eur. J. Comb.	2008	DBLP DOI BibTeX RDF
16	Rhiannon Hall, James G. Oxley, Charles Semple	The structure of 3-connected matroids of path width three.	Eur. J. Comb.	2007	DBLP DOI BibTeX RDF
16	Petr Hlinený	Crossing-number critical graphs have bounded path-width.	J. Comb. Theory, Ser. B	2003	DBLP DOI BibTeX RDF
16	János Barát, Péter Hajnal	Operations Which Preserve Path-Width at Most Two.	Comb. Probab. Comput.	2001	DBLP DOI BibTeX RDF
16	Reinhard Diestel	Graph Minors 1: A Short Proof of the Path-width Theorem.	Comb. Probab. Comput.	1995	DBLP DOI BibTeX RDF
16	Atsushi Takahashi 0001, Shuichi Ueno, Yoji Kajitani	Mixed Searching and Proper-Path-Width.	Theor. Comput. Sci.	1995	DBLP DOI BibTeX RDF
16	Atsushi Takahashi 0001, Shuichi Ueno, Yoji Kajitani	Minimal acyclic forbidden minors for the family of graphs with bounded path-width.	Discret. Math.	1994	DBLP DOI BibTeX RDF
16	Bruce A. Johnston, Peter J. W. Graumann, Laurence E. Turner	DSP System Synthesis Including Variable Data Path Width.	ISCAS	1994	DBLP DOI BibTeX RDF
16	Nancy G. Kinnersley	The Vertex Separation Number of a Graph equals its Path-Width.	Inf. Process. Lett.	1992	DBLP DOI BibTeX RDF
16	Atsushi Takahashi 0001, Shuichi Ueno, Yoji Kajitani	Mixed-Searching and Proper-Path-Width.	ISA	1991	DBLP DOI BibTeX RDF
15	Zhanfeng Jia, Rajarshi Gupta, Jean C. Walrand, Pravin Varaiya	Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration.	ISCC	2005	DBLP DOI BibTeX RDF
13	Tobias Polzin, Siavash Vahdati Daneshmand	Practical Partitioning-Based Methods for the Steiner Problem.	WEA	2006	DBLP DOI BibTeX RDF
8	Pranay Koka, Michael O. McCracken, Herb Schwetman, Xuezhe Zheng, Ron Ho, Ashok V. Krishnamoorthy	Silicon-photonic network architectures for scalable, power-efficient multi-chip systems.	ISCA	2010	DBLP DOI BibTeX RDF	interconnection networks, nanophotonics
8	Xin Wang, Tapani Ahonen, Jari Nurmi	Applying CDMA Technique to Network-on-Chip.	IEEE Trans. Very Large Scale Integr. Syst.	2007	DBLP DOI BibTeX RDF
8	Robert Wille, Görschwin Fey, Daniel Große, Stephan Eggersglüß, Rolf Drechsler	SWORD: A SAT like prover using word level information.	VLSI-SoC	2007	DBLP DOI BibTeX RDF
8	Gregory M. Provan	Approximate Model-Based Diagnosis Using Preference-Based Compilation.	SARA	2005	DBLP DOI BibTeX RDF
8	Tomás Lang, Javier D. Bruguera	Multilevel Reverse-Carry Computation for Comparison and for Sign and Overflow Detection in Addition.	ICCD	1999	DBLP DOI BibTeX RDF	Most significant carry, prefix tree, carry look-ahead adder
8	Jerry R. Burch, David L. Dill	Automatic verification of Pipelined Microprocessor Control.	CAV	1994	DBLP DOI BibTeX RDF