Search results for "branchings"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
56	Paul S. Bonsma, Frederic Dorn	Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree.	ESA	2008	DBLP DOI BibTeX RDF
56	Rolf H. Möhring, Matthias Müller-Hannemann	Complexity and Modeling Aspects of Mesh Refinement into Quadrilater.	Algorithmica	2000	DBLP DOI BibTeX RDF	Bidirected flows, cal NP -completeness, Computer-aided design, Mesh generation, Mesh decomposition
49	Yangjun Chen, Donovan Cooke	On the transitive closure representation and adjustable compression.	SAC	2006	DBLP DOI BibTeX RDF	databases, directed acyclic graphs, transitive closures, graph decomposition, branchings, topological order
49	Gerasimos G. Pollatos, Orestis Telelis, Vassilis Zissimopoulos	Updating Directed Minimum Cost Spanning Trees.	WEA	2006	DBLP DOI BibTeX RDF	data structures, branchings, dynamic graph algorithms
43	Nikolai Buzikashvili	Structure of Query Modification Process: Branchings.	ADMA	2008	DBLP DOI BibTeX RDF	non-linear search, Web query log, Query reformulation
37	Philippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang	Quasi-Static Scheduling of Communicating Tasks.	CONCUR	2008	DBLP DOI BibTeX RDF
31	Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick	Melding priority queues.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	disjoint set union, minimum directed spanning trees, optimum branchings, word RAM model, Priority queues, heaps, union-find
25	Kei Natsui, Kenjiro Takazawa	Finding popular branchings in vertex-weighted directed graphs.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
25	Daniela Bubboloni, Costanza Catalano, Andrea Marino 0001, Ana Silva 0001	On Computing Optimal Temporal Branchings and Spanning Subgraphs.	CoRR	2023	DBLP DOI BibTeX RDF
25	Sayani Ghosh, Bradley S. Meyer	Digraph Branchings and Matrix Determinants.	CoRR	2023	DBLP DOI BibTeX RDF
25	Daniela Bubboloni, Costanza Catalano, Andrea Marino 0001, Ana Silva 0001	On Computing Optimal Temporal Branchings.	FCT	2023	DBLP DOI BibTeX RDF
25	Kenjiro Takazawa	Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs.	Discret. Math. Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
25	Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo	Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2.	Graphs Comb.	2022	DBLP DOI BibTeX RDF
25	Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin	Popular branchings and their dual certificates.	Math. Program.	2022	DBLP DOI BibTeX RDF
25	Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo	Arc-disjoint in- and out-branchings in digraphs of independence number at most 2.	J. Graph Theory	2022	DBLP DOI BibTeX RDF
25	Kei Natsui, Kenjiro Takazawa	Finding Popular Branchings in Vertex-Weighted Digraphs.	WALCOM	2022	DBLP DOI BibTeX RDF
25	Victor A. Campos, Raul Lopes 0001, Andrea Marino 0001, Ana Silva 0001	Edge-Disjoint Branchings in Temporal Digraphs.	Electron. J. Comb.	2021	DBLP DOI BibTeX RDF
25	Hui Gao, Daqing Yang	Packing branchings under cardinality constraints on their root sets.	Eur. J. Comb.	2021	DBLP DOI BibTeX RDF
25	Kei Natsui, Kenjiro Takazawa	Finding popular branchings in vertex-weighted digraphs.	CoRR	2021	DBLP BibTeX RDF
25	Chao Xu 0010, Wenjun Li 0001, Jianxin Wang 0001, Yongjie Yang 0001	An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses.	J. Comb. Optim.	2021	DBLP DOI BibTeX RDF
25	Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh 0001	k-Distinct Branchings Admits a Polynomial Kernel.	ESA	2021	DBLP DOI BibTeX RDF
25	Oliver Kullmann, Oleg Zaikin 0002	Projection Heuristics for Binary Branchings Between Sum and Product.	SAT	2021	DBLP DOI BibTeX RDF
25	Ran Gu, Gregory Z. Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu	The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings.	COCOA	2021	DBLP DOI BibTeX RDF
25	Kenjiro Takazawa	Notes on Equitable Partition into Matching Forests in Mixed Graphs and into b-branchings in Digraphs.	CoRR	2020	DBLP BibTeX RDF
25	Victor A. Campos, Raul Lopes 0001, Andrea Marino 0001, Ana Silva 0001	Edge-Disjoint Branchings in Temporal Graphs.	CoRR	2020	DBLP BibTeX RDF
25	Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo	Non-separating spanning trees and out-branchings in digraphsof independence number 2.	CoRR	2020	DBLP BibTeX RDF
25	Gregory Z. Gutin, Yuefang Sun	Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs.	Discret. Math.	2020	DBLP DOI BibTeX RDF
25	Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin	Popular Branchings and Their Dual Certificates.	IPCO	2020	DBLP DOI BibTeX RDF
25	Kenjiro Takazawa	Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs.	ISCO	2020	DBLP DOI BibTeX RDF
25	Victor A. Campos, Raul Lopes 0001, Andrea Marino 0001, Ana Silva 0001	Edge-Disjoint Branchings in Temporal Graphs.	IWOCA	2020	DBLP DOI BibTeX RDF
25	Edin Husic, Xinyue Li, Ademir Hujdurovic, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanic, Alexandru I. Tomescu	MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP.	Bioinform.	2019	DBLP DOI BibTeX RDF
25	Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin	Popular Branchings and Their Dual Certificates.	CoRR	2019	DBLP BibTeX RDF
25	Gregory Z. Gutin, Yuefang Sun	Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs.	CoRR	2019	DBLP BibTeX RDF
25	Tatsuya Matsuoka, Zoltán Szigeti	Polymatroid-based capacitated packing of branchings.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
25	Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu	Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem.	ACM Trans. Algorithms	2018	DBLP DOI BibTeX RDF
25	Gregory Z. Gutin, Felix Reidl, Magnus Wahlström	k-distinct in- and out-branchings in digraphs.	J. Comput. Syst. Sci.	2018	DBLP DOI BibTeX RDF
25	Kristóf Bérczi, András Frank	Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings.	Math. Oper. Res.	2018	DBLP DOI BibTeX RDF
25	Attila Joó	Packing Countably Many Branchings with Prescribed Root-Sets in Infinite Digraphs.	J. Graph Theory	2018	DBLP DOI BibTeX RDF
25	Andreas Björklund, Petteri Kaski, Ioannis Koutis	Directed Hamiltonicity and Out-Branchings via Generalized Laplacians.	ICALP	2017	DBLP DOI BibTeX RDF
25	Gregory Z. Gutin, Felix Reidl, Magnus Wahlström	k-Distinct In- and Out-Branchings in Digraphs.	ICALP	2017	DBLP DOI BibTeX RDF
25	Jørgen Bang-Jensen, Saket Saurabh 0001, Sven Simonsen	Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs.	Algorithmica	2016	DBLP DOI BibTeX RDF
25	Kristóf Bérczi, András Frank	Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings.	CoRR	2016	DBLP BibTeX RDF
25	Gregory Z. Gutin, Felix Reidl, Magnus Wahlström	$k$-Distinct In- and Out-Branchings in Digraphs.	CoRR	2016	DBLP BibTeX RDF
25	Mario Leston Rey	Integral packing of branchings in capacitaded digraphs.	J. Comb. Optim.	2016	DBLP DOI BibTeX RDF
25	Jørgen Bang-Jensen, Anders Yeo	Balanced branchings in digraphs.	Theor. Comput. Sci.	2015	DBLP DOI BibTeX RDF
25	Orlando Lee, Mario Leston Rey	A faster algorithm for packing branchings in digraphs.	Discret. Appl. Math.	2015	DBLP DOI BibTeX RDF
25	Mario Leston Rey, Yoshiko Wakabayashi	Packing in generalized kernel systems: a framework that generalizes packing of branchings.	Math. Program.	2015	DBLP DOI BibTeX RDF
25	M. V. Davydov	A probabilistic search algorithm for finding suboptimal branchings in mutually exclusive hypothesis graph.	Int. J. Knowl. Based Intell. Eng. Syst.	2014	DBLP DOI BibTeX RDF
25	Jørgen Bang-Jensen, Jing Huang 0007	Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs.	J. Graph Theory	2014	DBLP DOI BibTeX RDF
25		A Faster Algorithm for Packing Branchings in Digraphs.	CoRR	2013	DBLP BibTeX RDF
25	Mario Leston Rey	A general framework for packing branchings and other combinatorial structures.		2012	RDF
25	Gregory Z. Gutin	Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems.	Electron. Notes Discret. Math.	2009	DBLP DOI BibTeX RDF
25	Valentin Ziegler	Approximating optimum branchings in linear time.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
25	Hasan Ertan Çetingül, Gernot Plank, Natalia A. Trayanova, René Vidal	Estimation of Multimodal Orientation Distribution Functions from Cardiac MRI for Tracking Purkinje Fibers Through Branchings.	ISBI	2009	DBLP DOI BibTeX RDF
25	Amitabha Bagchi, Ankur Bhargava, Torsten Suel	Approximate maximum weight branchings.	Inf. Process. Lett.	2006	DBLP DOI BibTeX RDF
25	Jorge J. G. Leandro, Roberto M. Cesar, Luciano da Fontoura Costa	Determining the branchings of 3D structures from respective 2D projections.	SIBGRAPI	2006	DBLP DOI BibTeX RDF
25	Jørgen Bang-Jensen, Stéphan Thomassé, Anders Yeo	Small degree out-branchings.	J. Graph Theory	2003	DBLP DOI BibTeX RDF
25	A. S. Nepomniaschaya	Efficient Implementation of Edmond's Algorithm for Finding Optimum Branchings on Associative Parallel Processors.	ICPADS	2001	DBLP DOI BibTeX RDF
25	Andreas Huck	Independent Trees and Branchings in Planar Multigraphs.	Graphs Comb.	1999	DBLP DOI BibTeX RDF
25	Philippe Gaucher	Combinatorics of branchings in higher dimensional automata	CoRR	1999	DBLP BibTeX RDF
25	Andreas Huck	Independent branchings in acyclic diagraphs.	Discret. Math.	1999	DBLP DOI BibTeX RDF
25	Danilo Bruschi, F. Ravasio	Random Parallel Algorithms for Finding Exact Branchings, Perfect Matchings, and Cycles.	Algorithmica	1995	DBLP DOI BibTeX RDF
25	Andreas Huck	Disproof of a conjecture about independent branchings in k-connected directed graphs.	J. Graph Theory	1995	DBLP DOI BibTeX RDF
25	Paul Caspi, Jean-Claude Fernandez, Alain Girault	An Algorithm for Reducing Binary Branchings.	FSTTCS	1995	DBLP DOI BibTeX RDF	object code optimization, on the fly bisimulation, observational equivalence
25	Phillip B. Gibbons, Richard M. Karp, Vijaya Ramachandran, Danny Soroker, Robert Endre Tarjan	Transitive Compaction in Parallel via Branchings.	J. Algorithms	1991	DBLP DOI BibTeX RDF
25	Jørgen Bang-Jensen	Edge-disjoint in- and out-branchings in tournaments and related path problems.	J. Comb. Theory, Ser. B	1991	DBLP DOI BibTeX RDF
25	Günter M. Ziegler	Branchings in rooted graphs and the diameter of greedoids.	Comb.	1988	DBLP DOI BibTeX RDF
25	Robin W. Whitty	Vertex-disjoint paths and edge-disjoint branchings in directed graphs.	J. Graph Theory	1987	DBLP DOI BibTeX RDF
25	László Lovász 0001	Computing ears and branchings in parallel	FOCS	1985	DBLP DOI BibTeX RDF
25	Po Tong, Eugene L. Lawler	A Faster Algorithm for Finding Edge-Disjoint Branchings.	Inf. Process. Lett.	1983	DBLP DOI BibTeX RDF
25	Paolo M. Camerini, Luigi Fratta, Francesco Maffioli	A note on finding optimum branchings.	Networks	1979	DBLP DOI BibTeX RDF
25	Robert Endre Tarjan	Finding optimum branchings.	Networks	1977	DBLP DOI BibTeX RDF
25	Delbert Ray Fulkerson, Gary C. Harding	On edge-disjoint branchings.	Networks	1976	DBLP DOI BibTeX RDF
25	Richard M. Karp	A simple derivation of Edmonds' algorithm for optimum branchings.	Networks	1971	DBLP DOI BibTeX RDF
19	Ezequiel Dratman, Guillermo Matera, Ariel Waissbein	Robust Algorithms For Generalized Pham Systems.	Comput. Complex.	2009	DBLP DOI BibTeX RDF	Primary 14Q05, 68W30 - Secondary 12Y05, 13F25, 14Q20, Subject classification, 68W40
19	Thomas Lange, Stefan Wörz, Karl Rohr, Peter-Michael Schlag	Landmark-Based 3D Elastic Registration of Pre- and Postoperative Liver CT Data.	Bildverarbeitung für die Medizin	2009	DBLP DOI BibTeX RDF
19	Jack Edmonds 0001	Branching Systems.	IWOCA	2009	DBLP DOI BibTeX RDF
19	James G. Malcolm, Martha Elizabeth Shenton, Yogesh Rathi	Two-Tensor Tractography Using a Constrained Filter.	MICCAI (1)	2009	DBLP DOI BibTeX RDF
19	James G. Malcolm, Martha Elizabeth Shenton, Yogesh Rathi	Neural Tractography Using an Unscented Kalman Filter.	IPMI	2009	DBLP DOI BibTeX RDF
19	Peter Damaschke	Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms.	IWPEC	2009	DBLP DOI BibTeX RDF
19	Maxim A. Babenko	An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem.	ISAAC	2008	DBLP DOI BibTeX RDF
19	Taolue Chen, Tingting Han 0001, Joost-Pieter Katoen	Time-Abstracting Bisimulation for Probabilistic Timed Automata.	TASE	2008	DBLP DOI BibTeX RDF	time-abstracting bisimulation, probabilistic timed automata
19	Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh 0001	Better Algorithms and Bounds for Directed Maximum Leaf Problems.	FSTTCS	2007	DBLP DOI BibTeX RDF
19	Steffen Oeltze, Bernhard Preim	Visualization of vasculature with convolution surfaces: method, validation and evaluation.	IEEE Trans. Medical Imaging	2005	DBLP DOI BibTeX RDF
19	Alexandru Condurache, Til Aach, Kai Eck, Jörg Bredno, Stephan Grzybowski, Hans-Günther Machens	Vessel Segmentation for Angiographic Enhancement and Analysis.	Bildverarbeitung für die Medizin	2005	DBLP DOI BibTeX RDF
19	Charles Florin, Nikos Paragios, James Williams 0003	Particle Filters, a Quasi-Monte Carlo Solution for Segmentation of Coronaries.	MICCAI	2005	DBLP DOI BibTeX RDF
19	Manuel Ojeda-Aciego, Agustín Valverde	tascpl: TAS Solver for Classical Propositional Logic.	JELIA	2004	DBLP DOI BibTeX RDF
19	David Castro 0007, Marc Giusti, Joos Heintz, Guillermo Matera, Luis Miguel Pardo	The Hardness of Polynomial Equation Solving.	Found. Comput. Math.	2003	DBLP DOI BibTeX RDF	Polynomial equation solving, Continuous data structure, Holomorphic and continuous encoding, Complexity, Elimination theory
19	André Leier, Wolfgang Banzhaf	Evolving Hogg's Quantum Algorithm Using Linear-Tree GP.	GECCO	2003	DBLP DOI BibTeX RDF
19	Andrew B. Kahng, Bao Liu 0001, Ion I. Mandoiu	Non-tree routing for reliability and yield improvement.	ICCAD	2002	DBLP DOI BibTeX RDF
19	Roland Glantz, Walter G. Kropatsch	Skeletons in the Framework of Graph Pyramids.	IWVF	2001	DBLP DOI BibTeX RDF
19	A. S. Nepomniaschaya	An Associative Parallel Algorithm for Finding a Critical Cycle in Directed Graphs.	ICPADS	2000	DBLP DOI BibTeX RDF	Directed weighted graph, critical cycle, optimum branching, bit-serial processing, associative parallel processor, time complexity
19	Gloria Gutiérrez, Inman P. de Guzmán, Javier Martínez 0001, Manuel Ojeda-Aciego, Agustín Valverde	Reduction Theorems for Boolean Formulas Using Delta-Trees.	JELIA	2000	DBLP DOI BibTeX RDF
19	Luc Robert, Grégoire Malandain	Fast Binary Image Processing Using Binary Decision Diagrams.	CVPR	1997	DBLP DOI BibTeX RDF	binary image processing, mathematical morphology, BDD, digital topology
19	Guido Gerig, Thomas Koller, Gábor Székely, Christian Brechbühler, Olaf Kübler	Symbolic Description of 3-D Structures Applied to Cerebral Vessel Tree Obtained from MR Angiography Volume Data.	IPMI	1993	DBLP DOI BibTeX RDF	Multidimensional image analysis, 3-D binary thinning, 3-D raster-tovector transform, magnetic resonance angiography, cerebrospinal vasculature, symbolic representation