Search results for "vertices"

Hits ?▲	Authors	Title	Venue	Year	Link
13	Heng Guo 0001, Mark Jerrum	Counting vertices of integer polytopes defined by facets.	CoRR	2021	DBLP BibTeX RDF
13	Heng Yang 0002, Ling Liang, Kim-Chuan Toh, Luca Carlone	STRIDE along Spectrahedral Vertices for Solving Large-Scale Rank-One Semidefinite Relaxations.	CoRR	2021	DBLP BibTeX RDF
13	Shiyong Zhu, Jianquan Lu, Daniel W. C. Ho, Jinde Cao	Polynomial-Time Algorithms for Structurally Observable Graphs by Controlling Minimal Vertices.	CoRR	2021	DBLP BibTeX RDF
13	Yu Zhu 0003, Boning Li, Santiago Segarra	Co-clustering Vertices and Hyperedges via Spectral Hypergraph Partitioning.	CoRR	2021	DBLP BibTeX RDF
13	Gustavo A. Bezerra, Pedro H. G. Lugão, Renato Portugal	Quantum walk-based search algorithms with multiple marked vertices.	CoRR	2021	DBLP BibTeX RDF
13	Sai Vamshi Samala, Subhajit Pramanick, Debasish Pattanayak, Partha Sarathi Mandal 0001	Filling MIS Vertices by Myopic Luminous Robots.	CoRR	2021	DBLP BibTeX RDF
13	Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke	New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups.	CoRR	2021	DBLP BibTeX RDF
13	Guido Montúfar, Yue Ren, Leon Zhang	Sharp bounds for the number of regions of maxout networks and vertices of Minkowski sums.	CoRR	2021	DBLP BibTeX RDF
13	Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, Hong Liu 0010	Well-mixing vertices and almost expanders.	CoRR	2021	DBLP BibTeX RDF
13	Sándor Bozóki, Gábor Domokos, Flórián Kovács, Krisztina Regos	Mono-monostatic polyhedra with uniform point masses have at least 8 vertices.	CoRR	2021	DBLP BibTeX RDF
13	Vladimir V. Mazalov, V. A. Khitraya	A Modified Myerson Value for Determining the Centrality of Graph Vertices.	Autom. Remote. Control.	2021	DBLP DOI BibTeX RDF
13	Nili Guttmann-Beck, Roni Rozen, Michal Stern	Vertices removal for feasibility of clustered spanning trees.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
13	Che-Nan Kuo, Yu-Huei Cheng	Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
13	Vladimir Bozovic, Zana Kovijanic Vukicevic, Goran Popivoda, Rong-Ying Pan, Xiao-Dong Zhang 0001	Extreme Wiener indices of trees with given number of vertices of maximum degree.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
13	Roghayeh Hafezieh, Mohammad Ali Hosseinzadeh, Samaneh Hossein-Zadeh, Ali Iranmanesh	On cut vertices and eigenvalues of character graphs of solvable groups.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
13	Valentin Bouquet, François Delbot, Christophe Picouleau	On the vertices belonging to all, some, none minimum dominating set.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
13	Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi	A method for enumerating pairwise compatibility graphs with a given number of vertices.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
13	Jérémie Turcotte, Samuel Yvon	4-cop-win graphs have at least 19 vertices.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
13	Sergei Chubanov	Correction to: A scaling algorithm for optimizing arbitrary functions over vertices of polytopes.	Math. Program.	2021	DBLP DOI BibTeX RDF
13	Sergei Chubanov	A scaling algorithm for optimizing arbitrary functions over vertices of polytopes.	Math. Program.	2021	DBLP DOI BibTeX RDF
13	Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Federica Laureana	The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis.	J. Optim. Theory Appl.	2021	DBLP DOI BibTeX RDF
13	Amélia Fonseca, Ângela Mestre, Ali Mohammadian, Cecília Perdigão, Maria Manuel Torres	The maximum number of Parter vertices of acyclic matrices.	Discret. Math.	2021	DBLP DOI BibTeX RDF
13	Milica Andelic, Domingos M. Cardoso, Slobodan K. Simic, Zoran Stanic	The main vertices of a star set and related graph parameters.	Discret. Math.	2021	DBLP DOI BibTeX RDF
13	Primoz Potocnik, Micael Toledo	Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices.	Discret. Math.	2021	DBLP DOI BibTeX RDF
13	Shuchao Li, Xuechao Li, Bing Wei 0001	Long cycles through specified vertices.	Discret. Math.	2021	DBLP DOI BibTeX RDF
13	Jacob Fox, Lisa Sauermann, Fan Wei	On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices.	Random Struct. Algorithms	2021	DBLP DOI BibTeX RDF
13	Daniel Reyes-Lastiri, Hans J. Cappon, Karel J. Keesman	Set-membership parameter estimation based on Voronoi vertices.	Environ. Model. Softw.	2021	DBLP DOI BibTeX RDF
13	Lucía M. González, Luciano N. Grippo, Martín D. Safe	Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs.	Australas. J Comb.	2021	DBLP BibTeX RDF
13	Naoki Matsumoto, Masaki Yamamoto 0001, Masahito Yamazaki	The minimum number of vertices of graphs containing two monochromatic triangles for any edge $2$-coloring.	Australas. J Comb.	2021	DBLP BibTeX RDF
13	Lidija Comic	A Combinatorial Coordinate System for the Vertices in the Octagonal $C_{4}C_{8}(S)$ Grid.	ISPA	2021	DBLP DOI BibTeX RDF
13	Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke	New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups.	SDM	2021	DBLP DOI BibTeX RDF
13	Sonja Stüdli, Yamin Yan, María M. Seron, Richard H. Middleton	Plug-and-Play Networks: Adding Vertices and Connections to Preserve Algebraic Connectivity.	CDC	2021	DBLP DOI BibTeX RDF
13	Luciano S. de Souza, Jonathan H. A. de Carvalho, Tiago A. E. Ferreira	Lackadaisical Quantum Walk in the Hypercube to Search for Multiple Marked Vertices.	BRACIS (1)	2021	DBLP DOI BibTeX RDF
13	Ricardo Velezmoro-León, Robert Ipanaqué Chero, Felícita Marcela Velásquez-Fernández, Jorge Jimenez Gomez	Construction of Polyhedra Whose Vertices are Points on Curve Which Lying on Lemniscatic Torus with Mathematica.	ICCSA (2)	2021	DBLP DOI BibTeX RDF
13	Sebastian Berndt 0001, Klaus Jansen, Kim-Manuel Klein	New Bounds for the Vertices of the Integer Hull.	SOSA	2021	DBLP DOI BibTeX RDF
13	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
13	Xiaochen Liu, Weiguo Zheng, Zhenyi Chen, Zhenying He, X. Sean Wang	Incrementally Finding the Vertices Absent from the Maximum Independent Sets.	PAKDD (1)	2021	DBLP DOI BibTeX RDF
13	Daniel Zint, Roberto Grosso	On the Link between Mesh Size Adaptation and Irregular Vertices.	VISIGRAPP (1: GRAPP)	2021	DBLP DOI BibTeX RDF
13	Arash Tavakoli, Mehdi Fatemi, Petar Kormushev	Learning to Represent Action Values as a Hypergraph on the Action Vertices.	ICLR	2021	DBLP BibTeX RDF
13	Lidija Comic	A Combinatorial Coordinate System for the Vertices in the Octagonal C4C8(R) Grid.	CAIP (1)	2021	DBLP DOI BibTeX RDF
13	Yu Zhu 0003, Boning Li, Santiago Segarra	Co-clustering Vertices and Hyperedges via Spectral Hypergraph Partitioning.	EUSIPCO	2021	DBLP DOI BibTeX RDF
13	Andre Löffler	Constrained Graph Layouts: Vertices on the Outer Face and on the Integer Grid.		2021	RDF
13	Dawei He, Yan Wang, Xingxing Yu	The Kelmans-Seymour conjecture II: 2-Vertices in K4-.	J. Comb. Theory, Ser. B	2020	DBLP DOI BibTeX RDF
13	Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour	Corrigendum to "Bisimplicial vertices in even-hole-free graphs".	J. Comb. Theory, Ser. B	2020	DBLP DOI BibTeX RDF
13	Dawei He, Yan Wang, Xingxing Yu	The Kelmans-Seymour conjecture III: 3-vertices in K4-.	J. Comb. Theory, Ser. B	2020	DBLP DOI BibTeX RDF
13	Kathie Cameron, Carsten Thomassen	Cycles containing all the odd-degree vertices.	J. Comb. Theory, Ser. B	2020	DBLP DOI BibTeX RDF
13	Samantha Dahlberg, Adrian She, Stephanie van Willigenburg	Schur and e-Positivity of Trees and Cut Vertices.	Electron. J. Comb.	2020	DBLP DOI BibTeX RDF
13	Jared Culbertson, Anton Dochtermann, Dan P. Guralnik, Peter F. Stiller	Extendable Shellability for $d$-Dimensional Complexes on $d+3$ Vertices.	Electron. J. Comb.	2020	DBLP DOI BibTeX RDF
13	Anna Kompisová, Robert Lukot'ka	Short Cycle Covers of Graphs with at Most 77% Vertices of Degree Two.	Electron. J. Comb.	2020	DBLP DOI BibTeX RDF
13	Ewa Drgas-Burchardt, Elzbieta Sidorowicz	Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common.	Discuss. Math. Graph Theory	2020	DBLP DOI BibTeX RDF
13	Oleg V. Borodin, Anna O. Ivanova, Ekaterina I. Vasil'eva	Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices.	Discuss. Math. Graph Theory	2020	DBLP DOI BibTeX RDF
13	Tian Tian, Liming Xiong	2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices.	Discuss. Math. Graph Theory	2020	DBLP DOI BibTeX RDF
13	Nawarat Ananchuen, Pawaton Kaemawichanurat	Connected domination critical graphs with cut vertices.	Discuss. Math. Graph Theory	2020	DBLP DOI BibTeX RDF
13	Carlos M. da Fonseca, Zhibin Du	The number of P-vertices of singular acyclic matrices: An inverse problem.	Discuss. Math. Graph Theory	2020	DBLP DOI BibTeX RDF
13	Imed Boudabbous, Walid Marweni	Description of the Triangle-free Prime Graphs Having at Most Two Non Critical Vertices.	J. Multiple Valued Log. Soft Comput.	2020	DBLP BibTeX RDF
13	Brendan D. McKay, Fang Tian	Asymptotic enumeration of linear hypergraphs with given number of vertices and edges.	Adv. Appl. Math.	2020	DBLP DOI BibTeX RDF
13	Youcef Magnouche, Sébastien Martin	Most vital vertices for the shortest s-t path problem: complexity and Branch-and-Cut algorithm.	Optim. Lett.	2020	DBLP DOI BibTeX RDF
13	Anna Deza, Antoine Deza, Zhongyan Guan, Lionel Pournin, Carlos Aníbal Suárez	Correction to: Distance between vertices of lattice polytopes.	Optim. Lett.	2020	DBLP DOI BibTeX RDF
13	Anna Deza, Antoine Deza, Zhongyan Guan, Lionel Pournin	Distance between vertices of lattice polytopes.	Optim. Lett.	2020	DBLP DOI BibTeX RDF
13	Mohammad Javad Nadjafi-Arani, Mahsa Mirzargar, Frank Emmert-Streib, Matthias Dehmer	Partition and Colored Distances in Graphs Induced to Subsets of Vertices and Some of Its Applications.	Symmetry	2020	DBLP DOI BibTeX RDF
13	Michal Stas	On the Crossing Numbers of the Joining of a Specific Graph on Six Vertices with the Discrete Graph.	Symmetry	2020	DBLP DOI BibTeX RDF
13	Khaled M. Elbassioni, Kazuhisa Makino	Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices.	SIAM J. Discret. Math.	2020	DBLP DOI BibTeX RDF
13	Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen	Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.	SIAM J. Discret. Math.	2020	DBLP DOI BibTeX RDF
13	Sávio Vinícius Albieri Barone Cantero, Diogo Nunes Gonçalves, Leonardo F. S. Scabini, Wesley Nunes Gonçalves	Importance of Vertices in Complex Networks Applied to Texture Analysis.	IEEE Trans. Cybern.	2020	DBLP DOI BibTeX RDF
13	Dhananjay R. Thiruvady, Rhyd Lewis, Kerri Morgan	Tackling the maximum happy vertices problem in large networks.	4OR	2020	DBLP DOI BibTeX RDF
13	Alexander Wang, Hailun Zheng	Centrally symmetric and balanced triangulations of S2×Sd-3 with few vertices.	Eur. J. Comb.	2020	DBLP DOI BibTeX RDF
13	Michael Fire, Carlos Guestrin	The rise and fall of network stars: Analyzing 2.5 million graphs to reveal how high-degree vertices emerge over time.	Inf. Process. Manag.	2020	DBLP DOI BibTeX RDF
13	Rinovia Simanjuntak, Susilawati, Edy Tri Baskoro	Total vertex irregularity strength for trees with many vertices of degree two.	Electron. J. Graph Theory Appl.	2020	DBLP DOI BibTeX RDF
13	M. Ilayaraja, K. Sowndhariya, Appu Muthusamy	Decomposition of product graphs into paths and stars on five vertices.	AKCE Int. J. Graphs Comb.	2020	DBLP DOI BibTeX RDF
13	Stefan Kratsch, Magnus Wahlström	Representative Sets and Irrelevant Vertices: New Tools for Kernelization.	J. ACM	2020	DBLP DOI BibTeX RDF
13	Yoshihiro Asayama, Ryo Matsukawa, Naoki Matsumoto, Atsuhiro Nakamoto	N-Flips in Triangulations with Two Odd Degree Vertices.	Graphs Comb.	2020	DBLP DOI BibTeX RDF
13	Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin	Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices.	Graphs Comb.	2020	DBLP DOI BibTeX RDF
13	Xihe Li, Ligong Wang 0001	Correction to: Gallai-Ramsey Numbers for a Class of Graphs with Five Vertices.	Graphs Comb.	2020	DBLP DOI BibTeX RDF
13	Kieran Clancy, Michael Haythorpe, Alex Newcombe, Ed Pegg	There Are No Cubic Graphs on 26 Vertices with Crossing Number 10 or 11.	Graphs Comb.	2020	DBLP DOI BibTeX RDF
13	Xihe Li, Ligong Wang 0001	Gallai-Ramsey Numbers for a Class of Graphs with Five Vertices.	Graphs Comb.	2020	DBLP DOI BibTeX RDF
13	Colton Magnant, Yaping Mao	On Cycles that Alternate Through Selected Sets of Vertices.	Graphs Comb.	2020	DBLP DOI BibTeX RDF
13	Zdenek Ryjácek, Petr Vrána, Liming Xiong	A Note on Singular Edges and Hamiltonicity in Claw-Free Graphs with Locally Disconnected Vertices.	Graphs Comb.	2020	DBLP DOI BibTeX RDF
13	Marthe Bonamy, Natasha Morrison, Alex Scott 0001	Partitioning the vertices of a torus into isomorphic subgraphs.	J. Comb. Theory, Ser. A	2020	DBLP DOI BibTeX RDF
13	Mohammad Azad	Decision Trees with at Most 19 Vertices for Knowledge Representation.	Trans. Rough Sets	2020	DBLP DOI BibTeX RDF
13	Markus Haltmeier, Sunghwan Moon	The conical Radon transform with vertices on triple lines.	CoRR	2020	DBLP BibTeX RDF
13	Santiago Guzmán-Pro, César Hernández-Cruz	Orientations without forbidden patterns on three vertices.	CoRR	2020	DBLP BibTeX RDF
13	Louis Brown	Sequences of well-distributed vertices on graphs and spectral bounds on optimal transport.	CoRR	2020	DBLP BibTeX RDF
13	Arash Tavakoli, Mehdi Fatemi, Petar Kormushev	Learning to Represent Action Values as a Hypergraph on the Action Vertices.	CoRR	2020	DBLP BibTeX RDF
13	Jérémie Turcotte, Samuel Yvon	4-cop-win graphs have at least 19 vertices.	CoRR	2020	DBLP BibTeX RDF
13	Sebastian Berndt 0001, Klaus Jansen, Kim-Manuel Klein	New Bounds for the Vertices of the Integer Hull.	CoRR	2020	DBLP BibTeX RDF
13	Kosuke Nakamura, Toru Araki	Partitioning vertices into in- and out-dominating sets in digraphs.	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
13	Peter Luo, Cun-Quan Zhang, Xiao-Dong Zhang 0001	Wiener index of unicycle graphs with given number of even degree vertices.	Discret. Math. Algorithms Appl.	2020	DBLP DOI BibTeX RDF
13	ChenKun Tsung, Hann-Jang Ho, Chien-Yu Chen 0006, Tien-Wei Chang, Sing-Ling Lee	Detecting Overlapping Communities in Modularity Optimization by Reweighting Vertices.	Entropy	2020	DBLP DOI BibTeX RDF
13	Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi	An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.	Entropy	2020	DBLP DOI BibTeX RDF
13	A. Bocci, Vincenzo Innocente, M. Kortelainen, Felice Pantaleo, Marco Rovere	Heterogeneous Reconstruction of Tracks and Primary Vertices With the CMS Pixel Tracker.	Frontiers Big Data	2020	DBLP DOI BibTeX RDF
13	Ronald J. Gould, Warren Shull	On spanning trees with few branch vertices.	Discret. Math.	2020	DBLP DOI BibTeX RDF
13	Weihua He, Hao Li 0002, Qiang Sun 0004	Locating any two vertices on Hamiltonian cycles in large graphs.	Discret. Math.	2020	DBLP DOI BibTeX RDF
13	Gerben J. Hettinga, Jirí Kosinka	A multisided C2 B-spline patch over extraordinary vertices in quadrilateral meshes.	Comput. Aided Des.	2020	DBLP DOI BibTeX RDF
13	Yue Ma, Weiyin Ma	A Global G2 Spline Space with Improved Geometry Consistency Near Extraordinary Vertices.	Comput. Aided Des.	2020	DBLP DOI BibTeX RDF
13	Emre Kolotoglu	A complete solution to the spectrum problem for graphs with six vertices and up to nine edges.	Contributions Discret. Math.	2020	DBLP BibTeX RDF
13	Alexander Pilz, Emo Welzl, Manuel Wettstein	From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices.	Discret. Comput. Geom.	2020	DBLP DOI BibTeX RDF
13	Dejan Govc, Waclaw Marzantowicz, Petar Pavesic	Estimates of Covering Type and the Number of Vertices of Minimal Triangulations.	Discret. Comput. Geom.	2020	DBLP DOI BibTeX RDF
13	Salman Parsa	Correction to: On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space.	Discret. Comput. Geom.	2020	DBLP DOI BibTeX RDF
13	Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong	Obstructions for three-coloring graphs without induced paths on six vertices.	J. Comb. Theory, Ser. B	2020	DBLP DOI BibTeX RDF
13	Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai	Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane.	J. Graph Theory	2020	DBLP DOI BibTeX RDF