Search results for "random graph"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pandurangan	A random graph approach to NMR sequential assignment.	RECOMB	2004	DBLP DOI BibTeX RDF	automated sequential resonance assignment, chemical shift degeneracy, nuclear magnetic resonance (NMR) spectroscopy, protein structure determination, randomized algorithm, probabilistic analysis, hamiltonian path, random graph model
3	András Faragó	Scalable analysis and design of ad hoc networks via random graph theory.	DIAL-M	2002	DBLP DOI BibTeX RDF	random network topology, ad hoc network, random graph model
3	Ryuhei Uehara	Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph.	ISPAN	1999	DBLP DOI BibTeX RDF	the lexicographically first maximal subgraph problems, threshold function of a random graph, Analysis of algorithms, P-completeness, NC algorithms
2	Sonal Patel, Eric Harley	Estimation of the number of cliques in a random graph.	C3S2E	2010	DBLP DOI BibTeX RDF
2	Marcin Piekarczyk	Hierarchical Random Graph Model for Off-line Handwritten Signatures Recognition.	CISIS	2010	DBLP DOI BibTeX RDF	off-line signature analysis, handwritten signature verification, hierarchical attributed random graph, knowledge-based systems, graph grammar
2	Alan Taylor, Desmond J. Higham	CONTEST: A Controllable Test Matrix Toolbox for MATLAB.	ACM Trans. Math. Softw.	2009	DBLP DOI BibTeX RDF	clustering, random graph, small-world, sparse matrix, matrix computation, preferential attachment, rewiring
2	Jun Wang, Gregory M. Provan	A Comparative Analysis of Specific Spatial Network Topological Models.	Complex	2009	DBLP DOI BibTeX RDF	Spatial Networks, Random Graph Models
2	Milan Bradonjic, Aric A. Hagberg, Allon G. Percus	Giant Component and Connectivity in Geographical Threshold Graphs.	WAW	2007	DBLP DOI BibTeX RDF	geographical threshold graph, giant component, connectivity, random graph
2	Guowen Han, Yuanyuan Yang	Scheduling and performance analysis of multicast interconnects.	The Journal of Supercomputing	2007	DBLP DOI BibTeX RDF	Quality-of-service (QoS), Approximation algorithms, Multicast, Interconnects, Scheduling algorithms, Random graph, Conflict graph
2	Vasiliki Liagkou, Effie Makri, Paul G. Spirakis, Yannis C. Stamatiou	The Threshold Behaviour of the Fixed Radius Random Graph Model and Applications to the Key Management Problem of Sensor Networks.	ALGOSENSORS	2006	DBLP DOI BibTeX RDF
2	Haixuan Yang, Irwin King, Michael R. Lyu	Predictive Random Graph Ranking on the Web.	IJCNN	2006	DBLP DOI BibTeX RDF
2	Jingtao Yu, Pingyi Fan, Kai Cai	Capacity analysis of maximal flow in ad hoc networks.	IWCMC	2006	DBLP DOI BibTeX RDF	max-flow min-cut, routing, network coding, random graph, network capacity
2	Rajeev Motwani, Ying Xu 0002	Evolution of page popularity under random web graph models.	PODS	2006	DBLP DOI BibTeX RDF	page popularity, random graph, web graph
2	Elad Barkan, Eli Biham, Adi Shamir	Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs.	CRYPTO	2006	DBLP DOI BibTeX RDF	Time/memory tradeoff, time/memory/data tradeoff, hidden state, stateful random graph, Hellman, lower bound, Cryptanalysis, rigorous, Rainbow
2	Ramin Hekmat, Piet Van Mieghem	Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio Model.	MONET	2006	DBLP DOI BibTeX RDF	giant component, log-normal, ad-hoc networks, connectivity, random graph
2	Abraham Flaxman, Alan M. Frieze, Juan Vera	Adversarial deletion in a scale free random graph process.	SODA	2005	DBLP DOI BibTeX RDF
2	Ai Noshiro, Takeshi Yoshikawa, Masahito Kurihara	Analysis of Connectedness of the Fixed Radius Random Graph Model in One-dimensional Space.	WSTST	2005	DBLP DOI BibTeX RDF
2	Uriel Feige, Eran Ofek	Finding a Maximum Independent Set in a Sparse Random Graph.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
2	Po-Han Lee, Chien-Hung Huang, Jywe-Fei Fang, Jeffrey J. P. Tsai, Ka-Lok Ng	Study of the protein-protein interaction networks via random graph approach.	IEEE ICCI	2005	DBLP DOI BibTeX RDF
2	Béla Bollobás, Oliver Riordan	The Diameter of a Scale-Free Random Graph.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C80
2	Steve Warner	The cofinality of the saturated uncountable random graph.	Arch. Math. Log.	2004	DBLP DOI BibTeX RDF
2	Ka-Lok Ng, Chien-Hung Huang	A Cross-species Study of the Protein-protein Interaction Networks via the Random Graph Approach.	BIBE	2004	DBLP DOI BibTeX RDF
2	Dimitris Achlioptas, Assaf Naor	The two possible values of the chromatic number of a random graph.	STOC	2004	DBLP DOI BibTeX RDF	graph coloring, random graphs, chromatic number
2	Alon Amit, Nathan Linial	Random Graph Coverings I: General Theory and Graph Connectivity.	Combinatorica	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C80, 05C40, 05C10
2	Piet Van Mieghem, Gerard Hooghiemstra, Remco van der Hofstad	On the efficiency of multicast.	IEEE/ACM Trans. Netw.	2001	DBLP DOI BibTeX RDF	k-ary tree, Internet, multicast, Efficiency, random graph
2	Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal	Random graph models for the web graph.	FOCS	2000	DBLP DOI BibTeX RDF	static HTML Web page, sparse random graphs, Erdos-Renyi models, statistics, directed graphs, directed graph, stochastic models, stochastic processes, Web graph, vertices, information resources, hyperlink, random processes, random graph model
2	Dimitris Achlioptas, Michael S. O. Molloy	The Analysis of a List-Coloring Algorithm on a Random Graph.	FOCS	1997	DBLP DOI BibTeX RDF	list-coloring algorithm, k-coloring algorithm, tight asymptotic analysis, performance, Markov chains, random graph, differential equations, graph colouring
2	Kamel Barkaoui, Rabah Benamara	Towards an efficient probabilistic deadlock detection method for multidatabase systems.	FTDCS	1997	DBLP DOI BibTeX RDF	probabilistic deadlock detection method, local transaction visibility, local systems autonomy, PCG method, mean condition, random graph theory, random deadlock detection, performance, concurrency control, concurrency control, contention, multidatabase systems
1	Sean L. Simpson, Malaak N. Moussa, Paul J. Laurienti	An exponential random graph modeling approach to creating group-based representative whole-brain connectivity networks.	NeuroImage	2012	DBLP DOI BibTeX RDF
1	Michal Przykucki	Optimal stopping in a search for a vertex with full degree in a random graph.	Discrete Applied Mathematics	2012	DBLP DOI BibTeX RDF
1	Michael Molloy	The freezing threshold for k-colourings of a random graph.	STOC	2012	DBLP DOI BibTeX RDF
1	Vladimir Ouzienko, Yuhong Guo, Zoran Obradovic	A decoupled exponential random graph model for prediction of structure and attributes in temporal social networks.	Statistical Analysis and Data Mining	2011	DBLP DOI BibTeX RDF
1	Christopher Groër, Blair D. Sullivan, Steve Poole	A mathematical analysis of the R-MAT random graph generator.	Networks	2011	DBLP DOI BibTeX RDF
1	Sourav Chatterjee, S. R. S. Varadhan	The large deviation principle for the Erdős-Rényi random graph.	Eur. J. Comb.	2011	DBLP DOI BibTeX RDF
1	Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald	Regular induced subgraphs of a random Graph.	Random Struct. Algorithms	2011	DBLP DOI BibTeX RDF
1	Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres	Anatomy of a young giant component in the random graph.	Random Struct. Algorithms	2011	DBLP DOI BibTeX RDF
1	Shankar Bhamidi, Remco van der Hofstad, Gerard Hooghiemstra	First Passage Percolation on the Erdős-Rényi Random Graph.	Combinatorics, Probability & Computing	2011	DBLP DOI BibTeX RDF
1	Lane Clark, Darin Johnson	The independent domination number of a random graph.	Discussiones Mathematicae Graph Theory	2011	DBLP BibTeX RDF
1	Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas	Explosive Percolation in Erdös-Rényi-Like Random Graph Processes	CoRR	2011	DBLP BibTeX RDF
1	Nicole Eggemann, Steven D. Noble	The clustering coefficient of a scale-free random graph.	Discrete Applied Mathematics	2011	DBLP DOI BibTeX RDF
1	Samuel Coskey, Paul Ellis, Scott Schneider	The conjugacy problem for the automorphism group of the random graph.	Arch. Math. Log.	2011	DBLP DOI BibTeX RDF
1	Colin Cooper, Alan M. Frieze	Component structure of the vacant set induced by a random walk on a random graph.	SODA	2011	DBLP BibTeX RDF
1	Abbas Mehrabian	A Randomly Embedded Random Graph is Not a Spanner.	CCCG	2011	DBLP BibTeX RDF
1	Sadegh Nobari, Xuesong Lu, Panagiotis Karras, Stéphane Bressan	Fast random graph generation.	EDBT	2011	DBLP DOI BibTeX RDF
1	Panagiotis Toulis, David C. Parkes	A random graph model of kidney exchanges: efficiency, individual-rationality and incentives.	ACM Conference on Electronic Commerce	2011	DBLP DOI BibTeX RDF
1	Anthony Bonato, Dejan Delic, Igor Dolinka	All countable monoids embed into the monoid of the infinite random graph.	Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Szymon Chojnacki, Mieczyslaw A. Klopotek	Random graph generative model for Folksonomy network structure approximation.	Procedia CS	2010	DBLP DOI BibTeX RDF
1	Reto Spöhel, Angelika Steger, Henning Thomas	Coloring the Edges of a Random Graph without a Monochromatic Giant Component.	Electr. J. Comb.	2010	DBLP BibTeX RDF
1	Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid	The t-Stability Number of a Random Graph.	Electr. J. Comb.	2010	DBLP BibTeX RDF
1	Nati Linial, Doron Puder	Word maps and spectra of random graph lifts.	Random Struct. Algorithms	2010	DBLP DOI BibTeX RDF
1	Prasad Chebolu, Alan M. Frieze, Páll Melsted	Finding a maximum matching in a sparse random graph in O(n) expected time.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Konstantinos Oikonomou, Dimitrios Kogias, Ioannis Stavrakakis	Probabilistic flooding for efficient information dissemination in random graph topologies.	Computer Networks	2010	DBLP DOI BibTeX RDF
1	Szymon Chojnacki, Mieczyslaw A. Klopotek	Random Graph Generator for Bipartite Networks Modeling	CoRR	2010	DBLP BibTeX RDF
1	Colin Cooper, Alan M. Frieze	Component structure induced by a random walk on a random graph	CoRR	2010	DBLP BibTeX RDF
1	Nicolaos Matsakis	Transforming a random graph drawing into a Lombardi drawing	CoRR	2010	DBLP BibTeX RDF
1	Hugo Zanghi, Stevenn Volant, Christophe Ambroise	Clustering based on random graph model embedding vertex features.	Pattern Recognition Letters	2010	DBLP DOI BibTeX RDF
1	Ziqi Zhang, Anna Lisa Gentile, Lei Xia, José Iria, Sam Chapman	A Random Graph Walk based Approach to Computing Semantic Relatedness Using Knowledge from Wikipedia.	LREC	2010	DBLP BibTeX RDF
1	Hamed Hatami, Michael Molloy	The Scaling Window for a Random Graph with a Given Degree Sequence.	SODA	2010	DBLP BibTeX RDF
1	Daniel Cordeiro, Grégory Mounié, Swann Perarnau, Denis Trystram, Jean-Marc Vincent, Frédéric Wagner	Random graph generation for scheduling simulations.	SimuTools	2010	DBLP BibTeX RDF
1	Ali Hamlili	Adaptive schemes for estimating random graph parameters in mobile wireless ad hoc networks' modeling.	Wireless Days	2010	DBLP DOI BibTeX RDF
1	Bo Tan, Laurent Massoulié	Brief announcement: adaptive content placement for peer-to-peer video-on-demand systems.	PODC	2010	DBLP DOI BibTeX RDF	content placement, peer-to-peer, video-on-demand, loss network
1	Mohsen Bayati, David Gamarnik, Prasad Tetali	Combinatorial approach to the interpolation method and scaling limits in sparse random graphs.	STOC	2010	DBLP DOI BibTeX RDF	scaling limit, constraint satisfaction problems, random graphs, partition function
1	Reto Spöhel, Angelika Steger, Henning Thomas	Coloring the edges of a random graph without a monochromatic giant component.	Electronic Notes in Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Wenhui Wang, Juan Nunez-Iglesias, Yihui Luan, Fengzhu Sun	Usefulness and limitations of dK random graph models to predict interactions and functional homogeneity in biological networks under a pseudo-likelihood parameter estimation approach.	BMC Bioinformatics	2009	DBLP DOI BibTeX RDF
1	Konstantinos Panagiotou, Angelika Steger	A note on the chromatic number of a dense random graph.	Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Amin Coja-Oghlan, Mihyun Kang	The evolution of the min-min random graph process.	Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Colin Cooper, Alan M. Frieze	Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439.	Random Struct. Algorithms	2009	DBLP DOI BibTeX RDF
1	Heidi Gebauer, Tibor Szabó	Asymptotic random graph intuition for the biased connectivity game.	Random Struct. Algorithms	2009	DBLP DOI BibTeX RDF
1	Nilesh N. Dalvi	Query Evaluation on a Database Given by a Random Graph.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Asymptotic probabilities, Random graphs, Conjunctive queries
1	Garry Robins	Social Networks, Exponential Random Graph (p*) Models for.	Encyclopedia of Complexity and Systems Science	2009	DBLP DOI BibTeX RDF
1	Dominik Dahlem, William Harrison	Waiting Time Sensitivities of Social and Random Graph Models.	ASONAM	2009	DBLP DOI BibTeX RDF
1	Diogo Ferreira, Luísa Lima, João Barros	NECO: NEtwork COding simulator.	SimuTools	2009	DBLP DOI BibTeX RDF	simulation, networks, topology, network coding, random graph
1	Pradip De, Yonghe Liu, Sajal K. Das	Deployment-aware modeling of node compromise spread in wireless sensor networks using epidemic theory.	TOSN	2009	DBLP DOI BibTeX RDF	Random key predistribution, epidemic theory, group-based deployment, sensor networks, random graph
1	Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin	Average-Case Analyses of Vickrey Costs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF	VCG auction, Random Assignment Problem, shortest path, minimum spanning tree, random graph, Average-case analysis, MST
1	Jun Wang, Gregory M. Provan	Characterizing the Structural Complexity of Real-World Complex Networks.	Complex	2009	DBLP DOI BibTeX RDF	Random Graph Generators, Complex Networks, Structural Complexity
1	Marc Lelarge	Efficient control of epidemics over random networks.	SIGMETRICS/Performance	2009	DBLP DOI BibTeX RDF	vaccination, random graphs, epidemics
1	Mohsen Bayati, Andrea Montanari, Amin Saberi	Generating random graphs with large girth.	SODA	2009	DBLP DOI BibTeX RDF
1	Navin Goyal, Luis Rademacher, Santosh Vempala	Expanders via random spanning trees.	SODA	2009	DBLP DOI BibTeX RDF
1	Elad Hazan, Robert Krauthgamer	How hard is it to approximate the best Nash equilibrium?	SODA	2009	DBLP DOI BibTeX RDF
1	Yuval Peres	The unreasonable effectiveness of martingales.	SODA	2009	DBLP DOI BibTeX RDF
1	Phokion G. Kolaitis, Swastik Kopparty	Random graphs and the parity quantifier.	STOC	2009	DBLP DOI BibTeX RDF	0-1 law, AC0, modular convergence, first-order logic
1	Silvio Lattanzi, D. Sivakumar	Affiliation networks.	STOC	2009	DBLP DOI BibTeX RDF	densification, social networks, diameter, sparsification
1	Omar Hasan, Lionel Brunie, Jean-Marc Pierson, Elisa Bertino	L'Elimination de la subjectivité dans la recommandation de confiance.	UbiMob	2009	DBLP DOI BibTeX RDF	social networks, trust, ubiquitous environments, subjectivity
1	Piet Van Mieghem, Huijuan Wang	The observable part of a network.	IEEE/ACM Trans. Netw.	2009	DBLP DOI BibTeX RDF	union of shortest paths, observability, overlay
1	David A. Huffaker, Jing (Annie) Wang, Jeffrey William Treem, Muhammad Aurangzeb Ahmad, Lindsay Fullerton, Dmitri Williams, Marshall Scott Poole, Noshir S. Contractor	The Social Behaviors of Experts in Massive Multiplayer Online Role-Playing Games.	CSE	2009	DBLP DOI BibTeX RDF
1	Geir Egeland, Paal Engelstad	The Availability and Reliability of Wireless Multi-Hop Networks with Stochastic Link Failures.	IEEE Journal on Selected Areas in Communications	2009	DBLP DOI BibTeX RDF
1	Andras Farago	Scalability of Node Degrees in Random Wireless Network Topologies.	IEEE Journal on Selected Areas in Communications	2009	DBLP DOI BibTeX RDF
1	Martin Haenggi, Jeffrey G. Andrews, François Baccelli, Olivier Dousse, Massimo Franceschetti, Donald F. Towsley	Guest Editorial: Geometry and Random Graphs for the Analysis and Design of Wireless Networks.	IEEE Journal on Selected Areas in Communications	2009	DBLP DOI BibTeX RDF
1	Guang Han, Armand M. Makowski	Sensitivity of Critical Transmission Ranges to Node Placement Distributions.	IEEE Journal on Selected Areas in Communications	2009	DBLP DOI BibTeX RDF
1	S. Charles Brubaker, Santosh Vempala	Random Tensors and Planted Cliques.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
1	Feng Wang 0002, Erika Camacho, Kuai Xu	Positive Influence Dominating Set in Online Social Networks.	COCOA	2009	DBLP DOI BibTeX RDF
1	Jin-Qing Fang, Yong Li	One Kind of Network Complexity Pyramid with Universality and Diversity.	Complex	2009	DBLP DOI BibTeX RDF
1	Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy	On the Structure of Industrial SAT Instances.	CP	2009	DBLP DOI BibTeX RDF
1	Ning Chen, Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Atri Rudra	Approximating Matches Made in Heaven.	ICALP	2009	DBLP DOI BibTeX RDF
1	Alexey S. Rodionov, Olga K. Rodionova, Hyunseung Choo	Using Meaning of Coefficients of the Reliability Polynomial for Their Faster Calculation.	ICCSA	2009	DBLP DOI BibTeX RDF	reliability polynomial, factoring method
1	Stephen F. Bush, Sanjay Goel	The Impact of Persistence Length on the Communication Efficiency of Microtubules and CNTs.	NanoNet	2009	DBLP DOI BibTeX RDF	Microtubules, Sensor Networks, Networks, Communication Networks, Carbon Nanotubes, Biology, Molecular Communication
1	David Eppstein, Emma S. Spiro	The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics.	WADS	2009	DBLP DOI BibTeX RDF
1	José Luis López-Presa, Antonio Fernández Anta	Fast Algorithm for Graph Isomorphism Testing.	SEA	2009	DBLP DOI BibTeX RDF
1	Hyunyoung Kil, Seog-Chan Oh, Ergin Elmacioglu, Wonhong Nam, Dongwon Lee	Graph Theoretic Topological Analysis of Web Service Networks.	World Wide Web	2009	DBLP DOI BibTeX RDF	giant component, web services, power-law, matchmaking, small world
1	Aurel Cami, Narsingh Deo	Techniques for analyzing dynamic random graph models of web-like networks: An overview.	Networks	2008	DBLP DOI BibTeX RDF