贿赂
发表于 2025-3-23 12:56:15
1-Extendability of Independent Setsh 1. seems to be very close to the problem of finding an independent set of maximum size (. .), we show that, interestingly, there exist 1-extendable graphs for which . is NP-hard. Finally, we investigate a parameterized version of 1..
立即
发表于 2025-3-23 17:49:46
http://reply.papertrans.cn/23/2299/229883/229883_12.png
apiary
发表于 2025-3-23 21:39:14
Graph Parameters, Implicit Representations and Factorial Propertieslicit representations deal with boundedness of some parameters, such as degeneracy or clique-width. In the present paper, we analyse more graph parameters and prove a number of new results related to implicit representation and factorial properties.
Paraplegia
发表于 2025-3-23 23:32:06
An Adjacency Labeling Scheme Based on a Decomposition of Trees into Caterpillarsefficient. We propose a simple tree-decomposition based encoding scheme and use it give an adjacency labeling of size .-bits. Here . is the clique-width of the graph family. We also extend the result to a certain family of .-probe graphs.
Synthesize
发表于 2025-3-24 05:19:56
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution a drawing algorithm that takes as input a 3-connected plane graph with . vertices and . internal faces and computes a convex straight-line drawing with edge-vertex resolution at least . on an integer grid of size ., where .. Our result improves the previously best-known area bound of . by Chrobak, Goodrich and Tamassia.
FLAG
发表于 2025-3-24 10:28:19
Tukey Depth Histogramsputational geometry can be phrased in terms of such depth histograms. As our main result, we give a complete characterization of the depth histograms of points, that is, for any dimension . we give a description of all possible histograms .. This then allows us to compute the exact number of different histograms of points.
TOM
发表于 2025-3-24 12:29:35
,Bestimmung der Stichprobengröße,licit representations deal with boundedness of some parameters, such as degeneracy or clique-width. In the present paper, we analyse more graph parameters and prove a number of new results related to implicit representation and factorial properties.
不适
发表于 2025-3-24 17:06:22
Statistics and Probability with Refficient. We propose a simple tree-decomposition based encoding scheme and use it give an adjacency labeling of size .-bits. Here . is the clique-width of the graph family. We also extend the result to a certain family of .-probe graphs.
Vulnerary
发表于 2025-3-24 20:55:40
http://reply.papertrans.cn/23/2299/229883/229883_19.png
专横
发表于 2025-3-25 00:18:26
https://doi.org/10.1007/978-1-4614-3652-2putational geometry can be phrased in terms of such depth histograms. As our main result, we give a complete characterization of the depth histograms of points, that is, for any dimension . we give a description of all possible histograms .. This then allows us to compute the exact number of different histograms of points.