Search results for "vertices"

Hits ?▲	Authors	Title	Venue	Year	Link
13	Oded Goldreich 0001	On Constructing Expanders for Any Number of Vertices.	Computational Complexity and Property Testing	2020	DBLP DOI BibTeX RDF
13	Yoshio Okamoto	Angular Resolutions: Around Vertices and Crossings.	Beyond Planar Graphs	2020	DBLP DOI BibTeX RDF
13	Valentina Turchyna, Kostiantyn Karavaiev	Analysis of algorithms for constructing dense sequencing of digraphs vertices.	CMIS	2020	DBLP BibTeX RDF
13	Yitzchak Novick, Amotz Bar-Noy	Finding High-Degree Vertices with Inclusive Random Sampling.	COMPLEX NETWORKS (1)	2020	DBLP DOI BibTeX RDF
13	Niels Lindner, Christian Liebchen	Determining All Integer Vertices of the PESP Polytope by Flipping Arcs.	ATMOS	2020	DBLP DOI BibTeX RDF
13	Kalyani Selvarajah, Ziad Kobti, Mehdi Kargar	Link Prediction by Analyzing Temporal Behavior of Vertices.	ICCS (3)	2020	DBLP DOI BibTeX RDF
13	Michael Drmota, Marc Noy, Benedikt Stufler	Cut Vertices in Random Planar Maps.	AofA	2020	DBLP DOI BibTeX RDF
13	Andris Ambainis, András Gilyén, Stacey Jeffery, Martins Kokainis	Quadratic speedup for finding marked vertices by quantum walks.	STOC	2020	DBLP DOI BibTeX RDF
13	Jan Gorzny, Jing Huang 0007	End-Vertices of AT-free Bigraphs.	COCOON	2020	DBLP DOI BibTeX RDF
13	Ray-Ming Chen	Metrics for Multi-Set-Theoretic Graphs over Fixed Set of Vertices.	ICoMS	2020	DBLP DOI BibTeX RDF
13	Rhyd Lewis	A Shortest Path Algorithm for Graphs Featuring Transfer Costs at Their Vertices.	ICCL	2020	DBLP DOI BibTeX RDF
13	Miguel Arcos-Argudo	Estructura de ciclos y vértices en Digrafos Fuertemente Conexos Minimales.		2020	RDF
13	Lorenzo Venturello	Balanced Triangulations on few Vertices and an Implementation of Cross-Flips.	Electron. J. Comb.	2019	DBLP DOI BibTeX RDF
13	Miklós Bóna, István Mezö	Limiting Probabilities for Vertices of a Given Rank in 1-2 Trees.	Electron. J. Comb.	2019	DBLP DOI BibTeX RDF
13	Alesom Zorzi, Celina M. H. de Figueiredo, Raphael Machado, Uéverton S. Souza	Even-power of Cycles With Many Vertices are Type 1 Total Colorable.	LAGOS	2019	DBLP DOI BibTeX RDF
13	Carlos Hoppen, Guilherme Oliveira Mota, Roberto F. Parente, Cristiane M. Sato	Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges.	LAGOS	2019	DBLP DOI BibTeX RDF
13	Andreas Brandstädt, Martin Milanic	A dichotomy for weighted efficient dominating sets with bounded degree vertices.	Inf. Process. Lett.	2019	DBLP DOI BibTeX RDF
13	Mamo Abebe Ashebo, V. N. Srinivasa Rao Repalle	Fuzzy Chromatic Polynomial of Fuzzy Graphs with Crisp and Fuzzy Vertices Using α-Cuts.	Adv. Fuzzy Syst.	2019	DBLP DOI BibTeX RDF
13	Sergey An. Gayvoronskiy, Tatiana Ezangina, Ivan Khozhaev, Viktor Kazmin	Determination of Vertices and Edges in a Parametric Polytope to Analyze Root Indices of Robust Control Quality.	Int. J. Autom. Comput.	2019	DBLP DOI BibTeX RDF
13	Lihua Ai, Lakshmish Ramaswamy, Siwei Luo	Impact Vertices-Aware Diffusion Walk Algorithm for Efficient Subgraph Pattern Matching in Massive Graphs.	IEEE Access	2019	DBLP DOI BibTeX RDF
13	Zhang-Hua Fu, Si-Bo Chen, Yi-Fei Ming, Yong-Quan Chen, Xiangjing Lai	Dynamically Reconstructing Minimum Spanning Trees After Swapping Pairwise Vertices.	IEEE Access	2019	DBLP DOI BibTeX RDF
13	Roberto Cruz, Juan Daniel Monsalve, Juan Rada	Maximal Augmented Zagreb Index of Trees With at Most Three Branching Vertices.	IEEE Access	2019	DBLP DOI BibTeX RDF
13	Akbar Ali, Shahzad Ahmed, Zhibin Du, Wei Gao 0012, Muhammad Aslam Malik	On the Minimal General Sum-Connectivity Index of Connected Graphs Without Pendant Vertices.	IEEE Access	2019	DBLP DOI BibTeX RDF
13	Rhyd Lewis, Dhananjay R. Thiruvady, Kerri Morgan	Finding happiness: An analysis of the maximum happy vertices problem.	Comput. Oper. Res.	2019	DBLP DOI BibTeX RDF
13	Daniele Catanzaro, Raffaele Pesenti	Enumerating vertices of the balanced minimum evolution polytope.	Comput. Oper. Res.	2019	DBLP DOI BibTeX RDF
13	Pieter Meysman, Yvan Saeys, Ehsan Sabaghian, Wout Bittremieux, Yves Van de Peer, Bart Goethals, Kris Laukens	Mining the Enriched Subgraphs for Specific Vertices in a Biological Graph.	IEEE ACM Trans. Comput. Biol. Bioinform.	2019	DBLP DOI BibTeX RDF
13	Eduardo Del Ángel-Martínez, Héctor Joaquín Fraire Huacuja, Carlos Soto 0001, Nelson Rangel-Valdez, Laura Cruz Reyes, Claudia Gómez Santillán	Un nuevo algoritmo de ramificación y acotamiento para el problema de la bisección de vértices.	Res. Comput. Sci.	2019	DBLP BibTeX RDF
13	Mohamed Amine Omrani, Wady Naanaa	On Generating Random Graphs Based on Fuzzy Proximity Relationships between Vertices.	Res. Comput. Sci.	2019	DBLP BibTeX RDF
13	Jun Kawahara, Koki Sonoda, Takeru Inoue, Shoji Kasahara	Efficient construction of binary decision diagrams for network reliability with imperfect vertices.	Reliab. Eng. Syst. Saf.	2019	DBLP DOI BibTeX RDF
13	Win Min Aye, Tao Tian, Liming Xiong	Number of vertices of degree three in spanning 3-trees in square graphs.	Appl. Math. Comput.	2019	DBLP DOI BibTeX RDF
13	Yanling Shao, Yubin Gao	The maximal geometric-arithmetic energy of trees with at most two branched vertices.	Appl. Math. Comput.	2019	DBLP DOI BibTeX RDF
13	Satoshi Taoka, Toshimasa Watanabe	Efficient Algorithms to Augment the Edge-Connectivity of Specified Vertices by One in a Graph.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2019	DBLP DOI BibTeX RDF
13	Zhiyang He, Michael Tait	Hypergraphs with Few Berge Paths of Fixed Length between Vertices.	SIAM J. Discret. Math.	2019	DBLP DOI BibTeX RDF
13	Louis DeBiasio, Allan Lo	Spanning Trees with Few Branch Vertices.	SIAM J. Discret. Math.	2019	DBLP DOI BibTeX RDF
13	Tomasz Kociumaka, Marcin Pilipczuk	Deleting Vertices to Graphs of Bounded Genus.	Algorithmica	2019	DBLP DOI BibTeX RDF
13	Minjia Shi, Denis S. Krotov, Patrick Solé	Correction to: A new distance-regular graph of diameter 3 on 1024 vertices.	Des. Codes Cryptogr.	2019	DBLP DOI BibTeX RDF
13	Minjia Shi, Denis S. Krotov, Patrick Solé	A new distance-regular graph of diameter 3 on 1024 vertices.	Des. Codes Cryptogr.	2019	DBLP DOI BibTeX RDF
13	Dongqin Cheng	Vertex-disjoint paths joining adjacent vertices in faulty hypercubes.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
13	Che-Nan Kuo, Yu-Huei Cheng	Cycles in folded hypercubes with two adjacent faulty vertices.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
13	Binlong Li, Liming Xiong, Jun Yin	Large degree vertices in longest cycles of graphs, II.	Electron. J. Graph Theory Appl.	2019	DBLP DOI BibTeX RDF
13	A. D. Forbes, Terry S. Griggs, K. A. Forbes	Designs for graphs with six vertices and ten edges.	Electron. J. Graph Theory Appl.	2019	DBLP DOI BibTeX RDF
13	Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda	Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves.	Graphs Comb.	2019	DBLP DOI BibTeX RDF
13	Rosena R. X. Du, Jia He, Xueli Yun	Counting Vertices with Given Outdegree in Plane Trees and k-ary Trees.	Graphs Comb.	2019	DBLP DOI BibTeX RDF
13	Pedro Company, Raquel Plumed, Peter A. C. Varley, Jorge D. Camba	Algorithmic Perception of Vertices in Sketched Drawings of Polyhedral Shapes.	ACM Trans. Appl. Percept.	2019	DBLP DOI BibTeX RDF
13	Amir Jalilifard, Vinicius Fernandes Caridá, Alex Mansano, Rogers Cristo	Can NetGAN be improved by short random walks originated from dense vertices?	CoRR	2019	DBLP BibTeX RDF
13	Fangyao Lu, Qianqian Wang, Tao Wang 0005	3-choosable planar graphs with some precolored vertices and no $5^{-}$-cycles normally adjacent to $8^{-}$-cycles.	CoRR	2019	DBLP BibTeX RDF
13	Klas Markström, Carsten Thomassen	Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices.	CoRR	2019	DBLP BibTeX RDF
13	Upasana Sridhar, Mark P. Blanco, Rahul Mayuranath, Daniele G. Spampinato, Tze Meng Low, Scott McMillan	Delta-stepping SSSP: from Vertices and Edges to GraphBLAS Implementations.	CoRR	2019	DBLP BibTeX RDF
13	Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius	Avoidable Vertices and Edges in Graphs.	CoRR	2019	DBLP BibTeX RDF
13	Isolde Adler, Philipp Klaus Krause	A lower bound on the tree-width of graphs with irrelevant vertices.	CoRR	2019	DBLP BibTeX RDF
13	Yixin Cao 0001, Guozhen Rong, Jianxin Wang 0001, Zhifeng Wang	Graph Searches and Their End Vertices.	CoRR	2019	DBLP BibTeX RDF
13	Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno	Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices.	CoRR	2019	DBLP BibTeX RDF
13	Valentin Bouquet, François Delbot, Christophe Picouleau	On the vertices belonging to all, some, none minimum dominating set.	CoRR	2019	DBLP BibTeX RDF
13	Joshua Feldman, Jeannette C. M. Janssen	High Degree Vertices and Spread of Infections in Spatially Modelled Social Networks.	CoRR	2019	DBLP BibTeX RDF
13	Andris Ambainis, András Gilyén, Stacey Jeffery, Martins Kokainis	Quadratic speedup for finding marked vertices by quantum walks.	CoRR	2019	DBLP BibTeX RDF
13	Irving Cruz-Matías, Dolors Ayala, Daniel Hiller, Sebastian Gutsch, Margit Zacharias, Sònia Estradé, Francesca Peiró	Sphericity and roundness computation for particles using the extreme vertices model.	J. Comput. Sci.	2019	DBLP DOI BibTeX RDF
13	Liudmila Yu. Zhilyakova	Resource Allocation Among Attractor Vertices in Asymmetric Regular Resource Networks.	Autom. Remote. Control.	2019	DBLP DOI BibTeX RDF
13	Liudmila Yu. Zhilyakova	Resource Network with Limited Capacity of Attractor Vertices.	Autom. Remote. Control.	2019	DBLP DOI BibTeX RDF
13	Joscha Prochno, Christoph Thäle, Nicola Turchi	The isotropic constant of random polytopes with vertices on convex surfaces.	J. Complex.	2019	DBLP DOI BibTeX RDF
13	Daniël Paulusma, Christophe Picouleau, Bernard Ries	Critical vertices and edges in H-free graphs.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
13	Xiaocong He, Shuchao Li, Qin Zhao	Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
13	Luzhen Ye, Weigen Yan	Resistance between two vertices of almost complete bipartite graphs.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
13	Zhibin Du, Carlos M. da Fonseca	The number of P-vertices for acyclic matrices of maximum nullity.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
13	Monica Bianchi, Alessandra Cornaro, José Luis Palacios, Anna Torriero	Lower bounds for the geometric-arithmetic index of graphs with pendant and fully connected vertices.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
13	Guillaume Ducoffe	Finding cut-vertices in the square roots of a graph.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
13	Hailiang Zhang, Guangting Chen, Guanglong Yu	On the largest matching roots of graphs with a given number of pendent vertices.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
13	Feifei Song, Jianjie Zhou	Spanning k-tree with specified vertices.	Discret. Math. Algorithms Appl.	2019	DBLP DOI BibTeX RDF
13	Yossi Lonke	Shadows of Cube Vertices.	Am. Math. Mon.	2019	DBLP DOI BibTeX RDF
13	Van Huy Pham 0001, Kien Trung Nguyen, Tran Thu Le	A linear time algorithm for balance vertices on trees.	Discret. Optim.	2019	DBLP DOI BibTeX RDF
13	Shuangyan Wang, Salvatore Cuomo, Gang Mei, Wuyi Cheng, Nengxiong Xu	Efficient method for identifying influential vertices in dynamic networks using the strategy of local detection and updating.	Future Gener. Comput. Syst.	2019	DBLP DOI BibTeX RDF
13	Bernard Lidický, Kacy Messerschmidt, Riste Skrekovski	Facial unique-maximum colorings of plane graphs with restriction on big vertices.	Discret. Math.	2019	DBLP DOI BibTeX RDF
13	Francesco Belardo, Maurizio Brunetti, Adriana Ciampella	On the multiplicity of α as an Aα(Γ)-eigenvalue of signed graphs with pendant vertices.	Discret. Math.	2019	DBLP DOI BibTeX RDF
13	Timothy Sun	A simple construction for orientable triangular embeddings of the complete graphs on 12s vertices.	Discret. Math.	2019	DBLP DOI BibTeX RDF
13	Kasper Szabo Lyngsie, Martin Merker	Spanning trees without adjacent vertices of degree 2.	Discret. Math.	2019	DBLP DOI BibTeX RDF
13	Oleg V. Borodin, Anna O. Ivanova	Describing faces in 3-polytopes with no vertices of degree from 5 to 7.	Discret. Math.	2019	DBLP DOI BibTeX RDF
13	Christopher Duffy 0001, Gary MacGillivray	The Firefighter problem: Saving sets of vertices on cubic graphs.	Networks	2019	DBLP DOI BibTeX RDF
13	Dmitry Anisimov, Kai Hormann, Teseo Schneider	Behaviour of exponential three-point coordinates at the vertices of convex polygons.	J. Comput. Appl. Math.	2019	DBLP DOI BibTeX RDF
13	Michael Fuchs 0001, Bernhard Gittenberger, Marefatollah Mansouri	Counting phylogenetic networks with few reticulation vertices: tree-child and normal networks.	Australas. J Comb.	2019	DBLP BibTeX RDF
13	Xi Li 0014, Hanwu Chen, Yue Ruan, Zhihao Liu, Wenjie Liu 0001	Continuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked vertices.	Quantum Inf. Process.	2019	DBLP DOI BibTeX RDF
13	Jiju Peethambaran, Amal Dev Parakkat, Andrea Tagliasacchi, Ruisheng Wang, Ramanathan Muthuganapathy	Incremental Labelling of Voronoi Vertices for Shape Reconstruction.	Comput. Graph. Forum	2019	DBLP DOI BibTeX RDF
13	Henrique F. da Cruz, Ilda Inácio Rodrigues, Rogério Pedro Serôdio	Convertible subspaces that arise from different numberings of the vertices of a graph.	Ars Math. Contemp.	2019	DBLP DOI BibTeX RDF
13	Isolde Adler, Philipp Klaus Krause	A lower bound on the tree-width of graphs with irrelevant vertices.	J. Comb. Theory, Ser. B	2019	DBLP DOI BibTeX RDF
13	Carol T. Zamfirescu	Cubic vertices in planar hypohamiltonian graphs.	J. Graph Theory	2019	DBLP DOI BibTeX RDF
13	Andrés Ángel, Jerson Borja	The evasiveness conjecture and graphs on 2p vertices.	J. Graph Theory	2019	DBLP DOI BibTeX RDF
13	Yixin Cao 0001, Zhifeng Wang, Guozhen Rong, Jianxin Wang 0001	Graph Searches and Their End Vertices.	ISAAC	2019	DBLP DOI BibTeX RDF
13	Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka	Exact Distance Oracles for Planar Graphs with Failing Vertices.	SODA	2019	DBLP DOI BibTeX RDF
13	Daniel Lokshtanov	Picking Random Vertices (Invited Talk).	MFCS	2019	DBLP DOI BibTeX RDF
13	Upasana Sridhar, Mark P. Blanco, Rahul Mayuranath, Daniele G. Spampinato, Tze Meng Low, Scott McMillan	Delta-Stepping SSSP: From Vertices and Edges to GraphBLAS Implementations.	IPDPS Workshops	2019	DBLP DOI BibTeX RDF
13	Viktor Bojovic, Bono Lucic, Drago Beslo, Karolj Skala, Nenad Trinajstic	Calculation of topological molecular descriptors based on degrees of vertices.	MIPRO	2019	DBLP DOI BibTeX RDF
13	Kshitij Gajjar, Jaikumar Radhakrishnan	Minimizing Branching Vertices in Distance-Preserving Subgraphs.	CSR	2019	DBLP DOI BibTeX RDF
13	Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius	Avoidable Vertices and Edges in Graphs.	WADS	2019	DBLP DOI BibTeX RDF
13	Lidija Comic	Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid.	DGCI	2019	DBLP DOI BibTeX RDF
13	Nikolajs Nahimovs	Lackadaisical Quantum Walks with Multiple Marked Vertices.	SOFSEM	2019	DBLP DOI BibTeX RDF
13	Elena Cabrera Revuelta, María José Chávez de Diego, Alberto Márquez Pérez	The Fortress Problem in Terms of the Number of Reflex and Convex Vertices. A 3D objects scanning application.	Electron. Notes Discret. Math.	2018	DBLP DOI BibTeX RDF
13	Nevena Maric	Cut polytope has vertices on a line.	Electron. Notes Discret. Math.	2018	DBLP DOI BibTeX RDF
13	Xing Huang	An implicit degree sum condition for cycles through specified vertices.	Inf. Process. Lett.	2018	DBLP DOI BibTeX RDF
13	Charles Bouveyron, Pierre Latouche, Rawya Zreik	The stochastic topic block model for the clustering of vertices in networks with textual edges.	Stat. Comput.	2018	DBLP DOI BibTeX RDF
13	Zongpeng Ding, Yuanqiu Huang	The crossing numbers of join of some graphs with n isolated vertices.	Discuss. Math. Graph Theory	2018	DBLP DOI BibTeX RDF
13	Jorge Moreno, Yuri Frota, Simone Martins	An exact and heuristic approach for the d-minimum branch vertices problem.	Comput. Optim. Appl.	2018	DBLP DOI BibTeX RDF
13	Zehui Shao, Pu Wu, Xiujun Zhang, Darko Dimitrov, Jia-Bao Liu	On the Maximum ABC Index of Graphs With Prescribed Size and Without Pendent Vertices.	IEEE Access	2018	DBLP DOI BibTeX RDF