Search results for "vertices"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
17	Sung-Ho Woo, Sung-Bong Yang	A Linear-Order Based Access Method for Efficient Network Computations.	EDCIS	2002	DBLP DOI BibTeX RDF
17	János Pach, Rephael Wenger	Embedding Planar Graphs at Fixed Vertex Locations.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
17	Stanislav Jendrol', Peter J. Owens	On Light Graphs in 3-Connected Plane Graphs Without Triangular or Quadrangular Faces.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
17	Ton Kloks, Dieter Kratsch, Haiko Müller	On the Structure of Graphs with Bounded Asteroidal Number.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
17	Anupam Gupta 0001	Steiner points in tree metrics don't (really) help.	SODA	2001	DBLP BibTeX RDF
17	Jirí Fiala 0001, Jan Kratochvíl, Andrzej Proskurowski	Distance Constrained Labeling of Precolored Trees.	ICTCS	2001	DBLP DOI BibTeX RDF
17	Ghislain Dartois, Alain Grigis	Separating Maps of the Lattice E8 and Triangulations of the Eight-Dimensional Torus.	Discret. Comput. Geom.	2000	DBLP DOI BibTeX RDF
17	Antoine Deza, Komei Fukuda, Dmitrii V. Pasechnik, Masanori Sato	On the Skeleton of the Metric Polytope.	JCDCG	2000	DBLP DOI BibTeX RDF
17	János Pach, Géza Tóth 0001	Unavoidable Configurations in Complete Topological Graphs.	GD	2000	DBLP DOI BibTeX RDF
17	Stephan J. Eidenbenz, Christoph Stamm	MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs.	IFIP TCS	2000	DBLP DOI BibTeX RDF
17	Konrad J. Swanepoel	Vertex Degrees of Steiner Minimal Trees in lpd and Other Smooth Minkowski Spaces.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
17	Mirela Damian-Iordache, Sriram V. Pemmaraju	Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs.	ISAAC	1999	DBLP DOI BibTeX RDF
17	Mihaly Agfalvi, Istvan Kadar, Erik Papp	Generalization of Pick's theorem for surface of polyhedra.	APL	1999	DBLP DOI BibTeX RDF	APL
17	Maurizio Talamo, Paola Vocca	Compact Implicit Representation of Graphs.	WG	1998	DBLP DOI BibTeX RDF
17	János Pach, Rephael Wenger	Embedding Planar Graphs at Fixed Vertex Locations.	GD	1998	DBLP DOI BibTeX RDF
17	Mohammod Abul Kashem, Xiao Zhou 0001, Takao Nishizeki	An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees.	ISPAN	1997	DBLP DOI BibTeX RDF	Separator tree, Vertex-ranking, Parallel algorithm, Treewidth, Partial k-tree
17	Sudipto Guha, Samir Khuller	Approximation Algorithms for Connected Dominating Sets.	ESA	1996	DBLP DOI BibTeX RDF
17	Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan 0001	Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs.	IPCO	1995	DBLP DOI BibTeX RDF
17	Magnús M. Halldórsson, Mario Szegedy	Lower Bounds for On-Line Graph Coloring.	SODA	1992	DBLP BibTeX RDF
17	Jeffery R. Westbrook	Fast Incremental Planarity Testing.	ICALP	1992	DBLP DOI BibTeX RDF
17	Hans L. Bodlaender	On the Complexity of Some Coloring Games.	WG	1990	DBLP DOI BibTeX RDF
17	Iain A. Stewart	Colouring Perfect Planar Graphs in Parallel.	WG	1988	DBLP DOI BibTeX RDF
17	Christos Levcopoulos, Andrzej Lingas	Bounds on the Length of Convex Partitions of Polygons.	FSTTCS	1984	DBLP DOI BibTeX RDF
13	Hao Guan, Seyed Hossein Sadati, Ali Asghar Talebi, Jana Shafi, Aysha Khan	A connectivity index based on adjacent vertices in cubic fuzzy graph with an application.	J. Intell. Fuzzy Syst.	2024	DBLP DOI BibTeX RDF
13	Shumei Zhang, Sijia Wang, Chunhui Zhao 0001	Vertices Packaging-Based Interval Independent Component Analysis (VP-I2CA) for Fault Detection With Process Uncertainty.	IEEE Trans. Ind. Informatics	2024	DBLP DOI BibTeX RDF
13	Chao Shi, Tianlong Ma	A note on maximum size of a graph without isolated vertices under the given matching number.	Appl. Math. Comput.	2024	DBLP DOI BibTeX RDF
13	Min Liu	Cycle Embedding in Enhanced Hypercubes with Faulty Vertices.	Symmetry	2024	DBLP DOI BibTeX RDF
13	Charis Papadopoulos, Athanasios E. Zisis	Computing and Listing Avoidable Vertices and Paths.	Algorithmica	2024	DBLP DOI BibTeX RDF
13	Wenying Xi, Wensong Lin	The Maximum 4-Vertex-Path Packing of a Cubic Graph Covers At Least Two-Thirds of Its Vertices.	Graphs Comb.	2024	DBLP DOI BibTeX RDF
13	Vadim E. Levit, Eugen Mandrescu	On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property.	CoRR	2024	DBLP DOI BibTeX RDF
13	Louis Carpentier, Jorik Jooken, Jan Goedgebeur	A heuristic algorithm using tree decompositions for the maximum happy vertices problem.	J. Heuristics	2024	DBLP DOI BibTeX RDF
13	Xiaoling He, Fuliang Lu	The cubic vertices of solid minimal bricks.	Discret. Math.	2024	DBLP DOI BibTeX RDF
13	Mateusz Kamyczura, Jakub Przybylo	On conflict-free proper colourings of graphs without small degree vertices.	Discret. Math.	2024	DBLP DOI BibTeX RDF
13	Dein Wong, Jinxing Zhao, Zhijun Wang, Chi Zhang	A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices.	Discret. Math.	2024	DBLP DOI BibTeX RDF
13	Teresa W. Haynes, Michael A. Henning	Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set.	Australas. J Comb.	2024	DBLP BibTeX RDF
13	Chris D. Godsil, Jamie Smith	Strongly cospectral vertices.	Australas. J Comb.	2024	DBLP BibTeX RDF
13	Anton Alyakin, Joshua Agterberg, Hayden S. Helm, Carey E. Priebe	Correcting a nonparametric two-sample graph hypothesis test for graphs with different numbers of vertices with applications to connectomics.	Appl. Netw. Sci.	2024	DBLP DOI BibTeX RDF
13	Maria Chudnovsky, Paul D. Seymour	Even-hole-free graphs still have bisimplicial vertices.	J. Comb. Theory, Ser. B	2023	DBLP DOI BibTeX RDF
13	Koyo Hayashi, Ken-ichi Kawarabayashi	Rooted topological minors on four vertices.	J. Comb. Theory, Ser. B	2023	DBLP DOI BibTeX RDF
13	Michael Drmota, Marc Noy, Benedikt Stufler	Cut Vertices in Random Planar Maps.	Electron. J. Comb.	2023	DBLP DOI BibTeX RDF
13	Csaba Biró, Jeno Lehel, Géza Tóth 0001	Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph.	Order	2023	DBLP DOI BibTeX RDF
13	Dang Hanh	Spanning trees with a bounded number of branch vertices in a K1, 4-free graph.	Discuss. Math. Graph Theory	2023	DBLP DOI BibTeX RDF
13	Anni Hakanen, Ville Junnila, Tero Laihonen, María Luz Puertas	On the metric dimensions for sets of vertices.	Discuss. Math. Graph Theory	2023	DBLP DOI BibTeX RDF
13	Usha Kumari, Renu Yadav, Amit Sehgal, Seema Mehra	The extreme vertices of the power graph of group Sn.	J. Appl. Math. Comput.	2023	DBLP DOI BibTeX RDF
13	Jongik Kim	Efficient graph edit distance computation using isomorphic vertices.	Pattern Recognit. Lett.	2023	DBLP DOI BibTeX RDF
13	Zongpeng Ding, Yuanqiu Huang, Licheng Zhang	Maximal 1-plane graphs with dominating vertices.	Appl. Math. Comput.	2023	DBLP DOI BibTeX RDF
13	Suyun Jiang, Jin Yan	Disjoint cycles covering specified vertices in bipartite graphs with partial degrees.	Appl. Math. Comput.	2023	DBLP DOI BibTeX RDF
13	Yujia He, Shurong Zhang, Lin Chen, Weihua Yang	The disjoint path cover in the data center network HSDC with prescribed vertices in each path.	Appl. Math. Comput.	2023	DBLP DOI BibTeX RDF
13	Ali Ghalavand, Sandi Klavzar, Mostafa Tavakoli, Mardjan Hakimi-Nezhaad, Freydoon Rahbarnia	Leap eccentric connectivity index in graphs with universal vertices.	Appl. Math. Comput.	2023	DBLP DOI BibTeX RDF
13	Jonathan Calzadillas, Dan McQuillan	Vertex-magic trees with n central vertices and kn leaves have bounded order for each k exceeding the square root of 3.	Bull. ICA	2023	DBLP BibTeX RDF
13	Xueru Xu, Zhong Chen, Guoyou Wang, He Deng, Longji Yu, Qimeng Chen	M2VDet: Midpoints-to-Vertices Detection of Oriented Objects in Remote-Sensing Images.	IEEE Trans. Geosci. Remote. Sens.	2023	DBLP DOI BibTeX RDF
13	Ioseph L. Buchbinder, Alexander A. Reshetnyak	Covariant Cubic Interacting Vertices for Massless and Massive Integer Higher Spin Fields.	Symmetry	2023	DBLP DOI BibTeX RDF
13	Marija Maksimovic	On Some Regular Two-Graphs up to 50 Vertices.	Symmetry	2023	DBLP DOI BibTeX RDF
13	Muhammad Rizwan, Sana Shahab, Akhlaq Ahmad Bhatti, Muhammad Javaid, Mohd Anjum	On the Hyper Zagreb Index of Trees with a Specified Degree of Vertices.	Symmetry	2023	DBLP DOI BibTeX RDF
13	Misa Nakanishi	A note on vertices contained in the minimum dominating set of a graph with minimum degree three.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
13	Subhajit Pramanick, Sai Vamshi Samala, Debasish Pattanayak, Partha Sarathi Mandal 0001	Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
13	Tahsin Reza, Trevor Steil, Geoffrey Sanders, Roger Pearce	Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs.	J. Parallel Distributed Comput.	2023	DBLP DOI BibTeX RDF
13	Vladimir A. Shlyk	Number of Vertices of the Polytope of Integer Partitions and Factorization of the Partitioned Number.	Exp. Math.	2023	DBLP DOI BibTeX RDF
13	Mahsa Mozafari-Nia, Moharram N. Iradmusa	Simultaneous coloring of vertices and incidences of outerplanar graphs.	Electron. J. Graph Theory Appl.	2023	DBLP DOI BibTeX RDF
13	Weiyan Wu, Eminjan Sabir, Hongwei Qiao	Embedding spanning disjoint cycles in augmented cube networks with prescribed vertices in each cycle.	Int. J. Parallel Emergent Distributed Syst.	2023	DBLP DOI BibTeX RDF
13	Péter Sziklai, Zsuzsa Weiner	Covering all but the low weight vertices of the unit cube.	J. Comb. Theory, Ser. A	2023	DBLP DOI BibTeX RDF
13	Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann 0001, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger	Splitting Vertices in 2-Layer Graph Drawings.	IEEE Computer Graphics and Applications	2023	DBLP DOI BibTeX RDF
13	Haci Ismail Aslan, Chang Choi, Hoon Ko	Classification of vertices on social networks by multiple approaches.	CoRR	2023	DBLP DOI BibTeX RDF
13	Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann 0001, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger	Splitting Vertices in 2-Layer Graph Drawings.	CoRR	2023	DBLP DOI BibTeX RDF
13	Suyoung Choi, Hyeontae Jang, Mathieu Vallée 0002	The characterization of (n-1)-spheres with n+4 vertices having maximal Buchstaber number.	CoRR	2023	DBLP DOI BibTeX RDF
13	Mauhing Yip, Annette Stahl, Christian Schellewald	Robust Hole-Detection in Triangular Meshes Irrespective of the Presence of Singular Vertices.	CoRR	2023	DBLP DOI BibTeX RDF
13	Mingxuan Fan, Yilun Jin, Liu Yang 0008, Zhenghang Ren, Kai Chen 0005	VERTICES: Efficient Two-Party Vertical Federated Linear Model with TTP-aided Secret Sharing.	CoRR	2023	DBLP DOI BibTeX RDF
13	Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Zhaohui Zhan	An Approximation Algorithm for Covering Vertices by 4^+-Paths.	CoRR	2023	DBLP DOI BibTeX RDF
13	Pouya Samanipour, Hasan A. Poonawala	Automated Stability Analysis of Piecewise Affine Dynamics Using Vertices.	CoRR	2023	DBLP DOI BibTeX RDF
13	Dongqin Cheng	Edge-disjoint trees passing through prescribed vertices in bubble-sort star graphs.	J. Comput. Sci.	2023	DBLP DOI BibTeX RDF
13	Dávid Papp, Krisztina Regos, Gábor Domokos, Sándor Bozóki	The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices.	Eur. J. Oper. Res.	2023	DBLP DOI BibTeX RDF
13	Shuchao Li, Nannan Liu, Huihui Zhang	Some extremal problems on the distance involving peripheral vertices of trees with given matching number.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
13	Margarita Akhmejanova, Konstantin Olmezov, Aleksei Volostnov, Ilya Vorobyev, Konstantin V. Vorob'ev, Yury Yarovikov	Wiener index and graphs, almost half of whose vertices satisfy Šoltés property.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
13	Shuya Chiba	Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
13	Tomás Vetrík	General Randić index of trees with given number of branching vertices.	Discret. Math. Algorithms Appl.	2023	DBLP DOI BibTeX RDF
13	Hanrui Wu, Yuguang Yan, Michael Kwok-Po Ng	Hypergraph Collaborative Network on Vertices and Hyperedges.	IEEE Trans. Pattern Anal. Mach. Intell.	2023	DBLP DOI BibTeX RDF
13	Venkatesan Maitreyi, Suresh Elumalai, Selvaraj Balachandran, Hechao Liu	The minimum Sombor index of trees with given number of pendant vertices.	Comput. Appl. Math.	2023	DBLP DOI BibTeX RDF
13	Mark Frenkel, Shraga Shoval, Edward Bormashenko	Shannon Entropy of Ramsey Graphs with up to Six Vertices.	Entropy	2023	DBLP DOI BibTeX RDF
13	Ruixia Wang, Zhiyi Zhou	Degree sum condition on distance 2 vertices for hamiltonian cycles in balanced bipartite graphs.	Discret. Math.	2023	DBLP DOI BibTeX RDF
13	Shuya Chiba, Masao Tsugaki, Tomoki Yamashita	A degree condition for cycles passing through specified vertices and edges.	Discret. Math.	2023	DBLP DOI BibTeX RDF
13	Zhibin Du, Carlos M. da Fonseca	The number of P-vertices for acyclic matrices with given nullity.	Discret. Math.	2023	DBLP DOI BibTeX RDF
13	Arnbjörg Soffía Árnadóttir, Chris D. Godsil	Strongly cospectral vertices in normal Cayley graphs.	Discret. Math.	2023	DBLP DOI BibTeX RDF
13	Miklós Bóna, Boris G. Pittel	Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves.	Random Struct. Algorithms	2023	DBLP DOI BibTeX RDF
13	Gefei Kong, Yi Zhao, Hongchao Fan	Detecting vertices of building roofs from ALS point cloud data.	Int. J. Digit. Earth	2023	DBLP DOI BibTeX RDF
13	Heng Guo 0001, Mark Jerrum	Counting Vertices of Integral Polytopes Defined by Facets.	Discret. Comput. Geom.	2023	DBLP DOI BibTeX RDF
13	Christian Buchta	The Duality of the Volumes and the Numbers of Vertices of Random Polytopes.	Discret. Comput. Geom.	2023	DBLP DOI BibTeX RDF
13	Francesco Carrabs, Raffaele Cerulli, Federica Laureana, Domenico Serra, Carmine Sorgente	A genetic approach for the 2-edge-connected minimum branch vertices problem.	Networks	2023	DBLP DOI BibTeX RDF
13	Jérémy Lavollée, Konrad J. Swanepoel	The Number of Small-Degree Vertices in Matchstick Graphs.	Australas. J Comb.	2023	DBLP BibTeX RDF
13	Cauê F. Teixeira da Silva, Daniel Posner, Renato Portugal	Walking on vertices and edges by continuous-time quantum walk.	Quantum Inf. Process.	2023	DBLP DOI BibTeX RDF
13	Gayatri Singh, Kavita Dorai, Arvind	Experimental quantum state transfer of an arbitrary single-qubit state on a cycle with four vertices using a coined quantum random walk.	Quantum Inf. Process.	2023	DBLP DOI BibTeX RDF
13	Chengli Li, Leyou Xu, Bo Zhou 0007	On the residual closeness of graphs with cut vertices.	J. Comb. Optim.	2023	DBLP DOI BibTeX RDF
13	Jialu Zhu, Xuding Zhu	Bad list assignments for non-k $k$-choosable k $k$-chromatic graphs with 2k+2 $2k+2$-vertices.	J. Graph Theory	2023	DBLP DOI BibTeX RDF
13	Chikashi Takai, Masahito Kumano, Masahiro Kimura	Analyzing Temporal Influence of Burst Vertices in Growing Social Simplicial Complexes.	COMPLEX NETWORKS (4)	2023	DBLP DOI BibTeX RDF
13	Li Dai, Yiping Song	Minimum Perfect Critical Sets with 4 Vertices of Tree Graphs.	ACC	2023	DBLP DOI BibTeX RDF
13	Subhajit Pramanick, Sai Vamshi Samala, Debasish Pattanayak, Partha Sarathi Mandal 0001	Filling MIS Vertices of a Graph by Myopic Luminous Robots.	ICDCIT	2023	DBLP DOI BibTeX RDF
13	Luisa Gargano, Adele A. Rescigno	An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width.	MFCS	2023	DBLP DOI BibTeX RDF
13	Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong 0001, Michael Kaufmann 0001, Giuseppe Liotta, Pat Morin, Alessandra Tappini	Nonplanar Graph Drawings with k Vertices per Face.	WG	2023	DBLP DOI BibTeX RDF
13	Joseph Hyde, Bruce Reed	Graphs of minimum degree at least ⌊d/2⌋ and large enough maximum degree embed every tree with d vertices.	LAGOS	2023	DBLP DOI BibTeX RDF
13	Pouya Samanipour, Hasan A. Poonawala	Automated Stability Analysis of Piecewise Affine Dynamics Using Vertices.	Allerton	2023	DBLP DOI BibTeX RDF
13	Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama	Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability.	ICTAI	2023	DBLP DOI BibTeX RDF