Search results for "Maximal-degree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
34	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
32	Ilan Sadeh, Amir Averbuch	Bounds on Parallel Computation of Multivariate Polynomials.	ISTCS	1992	DBLP DOI BibTeX RDF	Complexity of parallel computation, Design and analysis of parallel algorithms, Maximal-degree, Dense polynomial, Multivariate polynomials
32	Theodore I. Bieber, Mark D. Jackson	Applications of degree distribution. 1. (a) General discussion and computer generation of degree distributions. (b) Maximal degree distributions.	J. Chem. Inf. Comput. Sci.	1993	DBLP DOI BibTeX RDF
27	Guimei Liu, Kelvin Sim, Jinyan Li 0001	Efficient Mining of Large Maximal Bicliques.	DaWaK	2006	DBLP DOI BibTeX RDF
20	Martin Fürer, Balaji Raghavachari	Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree.	SODA	1992	DBLP BibTeX RDF
20	Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto	Edge Separators for Planar Graphs and Their Applications.	MFCS	1988	DBLP DOI BibTeX RDF
18	Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis	Self-stabilizing minimum-degree spanning tree within one from the optimal degree.	IPDPS	2009	DBLP DOI BibTeX RDF
18	Maw-Shang Chang, Haiko Müller	On the Tree-Degree of Graphs.	WG	2001	DBLP DOI BibTeX RDF
18	Radha Krishnan, Balaji Raghavachari	The Directed Minimum-Degree Spanning Tree Problem.	FSTTCS	2001	DBLP DOI BibTeX RDF
17	Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer	Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs.	DISC	2005	DBLP DOI BibTeX RDF
17	Aram Dermenjian	Maximal Degree Subposets of $\nu$-Tamari Lattices.	Electron. J. Comb.	2023	DBLP DOI BibTeX RDF
17	Wenjuan Zhou, Lei Sun	2-distance choice number of planar graphs with maximal degree no more than 4.	Discret. Math. Algorithms Appl.	2021	DBLP DOI BibTeX RDF
17	Samir Shukla	Homotopy Type of the Neighborhood Complexes of Graphs of Maximal Degree at most 3 and 4-Regular Circulant Graphs.	Electron. J. Comb.	2019	DBLP DOI BibTeX RDF
17	Suhirman, Jasni Mohamad Zain	On Maximal Degree of Domination for Decision Making.	DaEng	2015	DBLP DOI BibTeX RDF
17	Ayça Çesmelioglu, Wilfried Meidl	Bent Functions of Maximal Degree.	IEEE Trans. Inf. Theory	2012	DBLP DOI BibTeX RDF
17	Qiong Chen, Ting-Ting Wu	A method for local community detection by finding maximal-degree nodes.	ICMLC	2010	DBLP DOI BibTeX RDF
17	Claudia Malvenuto, Francesco Pappalardi	Corrigendum to "enumerating permutation polynomials - I: Permutations with non-maximal degree": [Finite Fields Appl. 8 (2002) 531-547].	Finite Fields Their Appl.	2007	DBLP DOI BibTeX RDF
17	Igor Razgon	A Faster Solving of the Maximum Independent Set Problem for Graphs with Maximal Degree 3.	ACiD	2006	DBLP BibTeX RDF
17	Michel Fournié, J.-Ph. Furter, D. Pinchon	Computation of the Maximal Degree of the Inverse of a Cubic Automorphism of the Affine Plane with Jacobian 1 via Gröbner Bases.	J. Symb. Comput.	1998	DBLP DOI BibTeX RDF
17	Peter Frankl	Erdös-Ko-Rado theorem with conditions on the maximal degree.	J. Comb. Theory, Ser. A	1987	DBLP DOI BibTeX RDF
17	Béla Bollobás	Chromatic number, girth and maximal degree.	Discret. Math.	1978	DBLP DOI BibTeX RDF
17	Alexandr V. Kostochka	The total coloring of a multigraph with maximal degree 4.	Discret. Math.	1977	DBLP DOI BibTeX RDF
17	Bohdan Zelinka	Determining the maximal degree of a tree given by its distance matrix.	Kybernetika	1973	DBLP BibTeX RDF
15	Guillermo Moreno Socías	An Ackermannian Polynomial Ideal.	AAECC	1991	DBLP DOI BibTeX RDF
15	Michael Kaufmann 0001	Polynomial Area Bounds for MST Embeddings of Trees.	GD	2007	DBLP DOI BibTeX RDF
15	Michael Alekhnovich	Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
15	Michael Alekhnovich	Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes.	FOCS	2002	DBLP DOI BibTeX RDF
15	Evangelos Kranakis, Danny Krizanc	Lower Bounds for Compact Routing (Extended Abstract).	STACS	1996	DBLP DOI BibTeX RDF
13	László Csirmaz, Péter Ligeti	On an infinite family of graphs with information ratio 2 - 1/k.	Computing	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 94A60, 94A17
12	Paul Camion, Claude Carlet, Pascale Charpin, Nicolas Sendrier	On Correlation-Immune Functions.	CRYPTO	1991	DBLP DOI BibTeX RDF
12	Volker Weispfenning	Some Bounds for the Construction of Gröbner Bases.	AAECC	1986	DBLP DOI BibTeX RDF
10	Roy Friedman, Alex Kogan	Brief announcement: deterministic dominating set construction in networks with bounded degree.	PODC	2010	DBLP DOI BibTeX RDF	dominating sets, bounded degree graphs, distributed approximation algorithms
10	Dirk Werth, Philipp Walter, Peter Loos	Distribution and Composition of Collaborative Business Processes through Peer-to-Peer Networks.	Business Process Management Workshops	2008	DBLP DOI BibTeX RDF
10	Chris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers	Computing the Quartet Distance Between Trees of Arbitrary Degree.	WABI	2005	DBLP DOI BibTeX RDF
10	Michael Sampels	Large Networks with Small Diameter.	WG	1997	DBLP DOI BibTeX RDF
7	Márk Jelasity, Vilmos Bilicki	Scalable P2P Overlays of Very Small Constant Degree: An Emerging Security Threat.	SSS	2009	DBLP DOI BibTeX RDF
7	Yuval Peres	The unreasonable effectiveness of martingales.	SODA	2009	DBLP DOI BibTeX RDF
7	Qiang Zhang, Michael W. Berry, Brian T. Lamb, Tabitha K. Samuel	A Parallel Nonnegative Tensor Factorization Algorithm for Mining Global Climate Data.	ICCS (2)	2009	DBLP DOI BibTeX RDF	nonnegative tensor factorization, global climate, data mining, parallel computation
7	Alexander Engström	Set Partition Complexes.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Set partition complex, Hom complex, Topological combinatorics, Ramsey theory
7	Yuval Elias, José M. Fernandez 0001, Tal Mor, Yossi Weinstein	Optimal Algorithmic Cooling of Spins.	UC	2007	DBLP DOI BibTeX RDF
7	Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia	Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs.	SIROCCO	2007	DBLP DOI BibTeX RDF	Edge Colouring, Wedge, Wireless Network, Location Awareness, Local Algorithm, Unit Disk Graphs, Geometric Graphs
7	Fabian Kuhn, Thomas Moscibroda	Distributed approximation of capacitated dominating sets.	SPAA	2007	DBLP DOI BibTeX RDF	distributed approximation, capacities, dominating sets, LP relaxation
7	Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro	Searching for a black hole in arbitrary networks: optimal mobile agents protocols.	Distributed Comput.	2006	DBLP DOI BibTeX RDF	Topological knowledge, Mobile agents, Distributed search, Black hole, Malicious host
7	Yonatan Bilu, Nathan Linial	Lifts, Discrepancy and Nearly Optimal Spectral Gap*.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C22, 05C35, 05C80, 05C50
7	Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer	Fault-Tolerant Clustering in Ad Hoc and Sensor Networks.	ICDCS	2006	DBLP DOI BibTeX RDF
7	Bin Liu, Fabrizio Lombardi, Nohpill Park, Minsu Choi	Testing Layered Interconnection Networks.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF
7	Kurt Jetter, Georg Zimmermann	Polynomial Reproduction in Subdivision.	Adv. Comput. Math.	2004	DBLP DOI BibTeX RDF	vector subdivision, polynomial reproduction
7	Yonatan Bilu, Nathan Linial	Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap.	FOCS	2004	DBLP DOI BibTeX RDF	Lifts of Graphs, Signed Graphs, Expander Graphs, Discrepancy, Lifts
7	Sofie Haesevoets, Bart Kuijpers	Time-dependent affine triangulation of spatio-temporal data.	GIS	2004	DBLP DOI BibTeX RDF	triangulations, spatio-temporal data models
7	Evgeniya V. Adutskevich, Nickolai A. Likhoded	Mapping Affine Loop Nests: Solving of the Alignment and Scheduling Problems.	PaCT	2003	DBLP DOI BibTeX RDF
7	Jean-Charles Faugère, Antoine Joux	Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases.	CRYPTO	2003	DBLP DOI BibTeX RDF
7	Vladlen Koltun, Micha Sharir	On the overlay of envelopes in four dimensions.	SODA	2002	DBLP BibTeX RDF
7	Ho-Lin Chen, Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen	Some Applications of Orderly Spanning Trees in Graph Drawing.	GD	2002	DBLP DOI BibTeX RDF
7	Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro	Searching for a black hole in arbitrary networks: optimal mobile agent protocols.	PODC	2002	DBLP DOI BibTeX RDF	distributed computing, mobile agents, black holes
7	Fabrizio Lombardi, Nohpill Park	Testing Layered Interconnection Networks.	DFT	2002	DBLP DOI BibTeX RDF	Fault Tolerance, Interconnection Networks, Fault Detection, Network Flow, Switch
7	Evangelos Kranakis, Danny Krizanc, Sunil M. Shende	Approximate Hotlink Assignment.	ISAAC	2001	DBLP DOI BibTeX RDF
7	Robert Elsässer, Rastislav Kralovic, Burkhard Monien	Scalable Sparse Topologies with Small Spectrum.	STACS	2001	DBLP DOI BibTeX RDF
7	Shlomi Dolev, Amos Israeli, Shlomo Moran	Uniform Dynamic Self-Stabilizing Leader Election.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	distributed algorithms, synchronization, leader election, Self-stabilizing systems, randomized distributed algorithms
7	Michel Morvan, Laurent Viennot	Parallel Comparability Graph Recognition and Modular Decomposition.	STACS	1996	DBLP DOI BibTeX RDF
7	Volker Heun, Ernst W. Mayr	Embedding Graphs with Bounded Treewidth into Optimal Hypercubes.	STACS	1996	DBLP DOI BibTeX RDF
7	Michael A. Frumkin	A fast algorithm for expansion over spherical harmonics.	Appl. Algebra Eng. Commun. Comput.	1995	DBLP DOI BibTeX RDF	Legendre polynomial, Complexity, Fast algorithm, Spherical harmonics
7	Ondrej Sýkora, Imrich Vrto	Edge Separators for Graphs of Bounded Genus with Applications.	WG	1991	DBLP DOI BibTeX RDF
7	Marc Giusti	Complexity of Standard Bases in Projective Dimension Zero II.	AAECC	1990	DBLP DOI BibTeX RDF
7	Jürgen Plehn, Bernd Voigt	Finding Minimally Weighted Subgraphs.	WG	1990	DBLP DOI BibTeX RDF
7	Michael Kaufmann 0001, Kurt Mehlhorn	Routing Through a Generalized Switchbox.	ICALP	1985	DBLP DOI BibTeX RDF